An ant's story:
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
cin.ignore();
while(n--){
long long l,v,m;
cin>>l>>v>>m;
if(v>0) //均匀增加,走过的和没走的都要增加
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
转载于:https://blog.51cto.com/beyond316/1259932