总结:找出左边向右,右边向左的蚂蚁数量,若该蚂蚁向右判断右边是否有向左的蚂蚁,如果该蚂蚁向左,判断左边是否有向右的蚂蚁
#include<iostream> #include<cmath> using namespace std; #define MAX 50 int ant[MAX]; int main() { int n; cin>>n; int left=0,right=0; for (int i=0;i<n;i++){ cin>>ant[i]; } int h=abs(ant[0]); for (int i=1;i<n;i++) { if (ant[i]>0&&abs(ant[i])<h) left++; else if (ant[i]<0&&abs(ant[i])>h) right++; } if ((left==0&&ant[0]>0)||(right==0&&ant[0]<0)) cout<<1<<endl; else cout<<left+right+1<<endl; return 0; }