【CodeForces】[610B]Vika and Squares
2016-04-07 13:17
218 查看
思路是首先有至少
最小的那一种*n次(注意数据范围)
然后剩下的以最小的那个为分割
可以分成几部分
取其中最大的那一部分的个数加入结果
(最前面的和最后面的可以视为同一组)
#include<stdio.h> int a[200200]; int main() { int n; while(scanf("%d",&n)!=EOF) { scanf("%d",&a[0]); int min=a[0]; for(int i=1; i<n; i++) { scanf("%d",&a[i]); if(min>a[i]) min=a[i]; } __int64 res=(__int64)min*(__int64)n; int t=0; int tres=0; int maxtres=0; int firt=0; bool flag=false; for(int i=0; i<n; i++) { a[i]-=min; if(a[i]!=0) { if(flag) { tres++; } else { firt++; } } else { flag=true; if(maxtres<tres) maxtres=tres; tres=0; } } tres+=firt; if(maxtres<tres) maxtres=tres; printf("%I64d\n",res+(__int64)maxtres); } return 0; }
题目地址:【CodeForces】[610B]Vika and Squares
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- codeforces 618C. Constellation
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- CodeForces 603A_Alternative Thinking (DP)
- CodeForces 602B_Approximating a Constant Range_DP
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query