uva - 10730 - Antiarithmetic?(暴力枚举)
2017-08-06 14:39
435 查看
#include<cstdio> #include<vector> #include<queue> #include<cmath> #include<cstring> #include <cstdlib> #include<iostream> #include<algorithm> using namespace std; typedef long long LL; const int maxn = 10100; int a[maxn],n; int main() { while(scanf("%d",&n)==1&&n){ scanf(":"); for(int i=1;i<=n;i++){ int x; scanf("%d",&x); x++; a[x] = i; } bool flag=true; for(int i=1;i<=n;i++){ for(int j=1;i+2*j<=n;j++){ if( (a[i] < a[j+i] && a[j+i] < a[j+j+i]) ||(a[i] > a[j+i] && a[j+i] > a[j+j+i]) ) {flag=false; break;} } if(!flag) break; } if(flag) printf("yes\n"); else printf("no\n"); } return 0; }
相关文章推荐
- uva - 10730 - Antiarithmetic?(暴力枚举)
- uva 10730 - Antiarithmetic?(枚举)
- UVA 10730 - Antiarithmetic?(技巧枚举)
- 10730-Antiarithmetic?【暴力枚举】
- uva 221 - Urban Elevations(暴力枚举)
- UVA 617 - Nonstop Travel(数论+暴力枚举)
- 紫书 例题7-2 UVA 11059 暴力枚举
- UVA 11210 暴力枚举 + 递归(hdu 4431)
- (UVA - 10976)Fractions Again?!(技巧,暴力枚举)
- UVALive 6912 Prime Switch 暴力枚举+贪心
- UVA 592 逻辑之岛(暴力枚举)
- (暴力枚举) UVa 10976 Fractions Again?!
- uva 10273 - Eat or Not to Eat?(暴力枚举)
- UVA 455 暴力枚举
- UVA 10825 Anagram and Multiplication(暴力枚举)
- uva 565(暴力+枚举)
- UVA 1262 Password 暴力枚举
- Uva 10167 - Birthday Cake 暴力枚举
- uva 10167 Birthday Cake(暴力枚举)
- 暴力枚举 UVA 10976 Fractions Again?!