y总的王者思路

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
int ans=1;
int x[N];
int n,p;



int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++ ) scanf("%d",&x[i]);
    int left=0,right=0;//记录左边向右走的和右边向左走的
    for (int i = 2; i <= n; i ++ )
    {
        if (abs(x[i]) < abs(x[1]) && x[i] > 0) left ++ ;
        else if (abs(x[i]) > abs(x[1]) && x[i] < 0) right ++ ;

    }
    p=1+left+right;
    if (x[1] > 0 && right == 0 || x[1] < 0 && left == 0)//感冒的蚂蚁向右走并且感冒的蚂蚁右边没有向左走的蚂蚁
    //或者感冒的蚂蚁向左走并且感冒的蚂蚁左边没有向右走的蚂蚁
    {
        printf("1");
    }
    else printf("%d",p);

    return 0;
}