2481 顺时针机器人
题解:我们可以画出行动的路线,然后我们可以发现机器人每次走的路的长度必须比前2个的地方走的远就可以,也就是 dis[i] = dis[i - 2],然后注意特判n <= 3即可
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int dx[4] = {0,-1,0,1};
int dy[4] = {1,0,-1,0};
void solve(){
int t; cin >> t;
while(t--){
int n;
cin >> n;
if(n <= 3) {
cout << "false" << '\n';
continue;
}
int l = 0,r = 0,d = 0,u = 0;
int x,y;
x = y = 0;
bool ok = 1;
int now = 0;
vector<int> dis(n + 10,0);
for(int i = 1; i <= n; i++){
int tmp = 0;
cin >> tmp;
dis[i] = tmp;
if(i > 2) {
if(dis[i] <= dis[i - 2]) {
ok = 0;
}
}
now++;
if(now == 4) now = 0;
}
if(ok == 0) cout << "true" << '\n';
else cout << "false" << '\n';
}
}
int main(){
solve();
return 0;
}