600 div2A
for(int i = 0;i < n;i ++){
if(b[i] < 0) ans = 1;
else if(b[i] > 0 && t == 0){
t = b[i];
while(b[i] == t && i < n) i ++;
i --;//外层每次就++,这里得减一次
}
else if(b[i] > 0) ans = 1;
}
600 div2A
for(int i = 0;i < n;i ++){
if(b[i] < 0) ans = 1;
else if(b[i] > 0 && t == 0){
t = b[i];
while(b[i] == t && i < n) i ++;
i --;//外层每次就++,这里得减一次
}
else if(b[i] > 0) ans = 1;
}