2013 ACM/ICPC Asia Regional Hangzhou Online ----Two Rabbits
2013-09-16 22:26
375 查看
Two Rabbits
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1126 Accepted Submission(s): 67
Problem Description
Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to play a game with some stones. There were n stones on the ground and they were arranged as a clockwise ring. That is to say, the first stone was adjacent
to the second stone and the n-th stone, and the second stone is adjacent to the first stone and the third stone, and so on. The weight of the i-th stone is ai.
The rabbits jumped from one stone to another. Tom always jumped clockwise, and Jerry always jumped anticlockwise.
At the beginning, the rabbits both choose a stone and stand on it. Then at each turn, Tom should choose a stone which have not been stepped by itself and then jumped to it, and Jerry should do the same thing as Tom, but the jumping direction is anti-clockwise.
For some unknown reason, at any time , the weight of the two stones on which the two rabbits stood should be equal. Besides, any rabbit couldn't jump over a stone which have been stepped by itself. In other words, if the Tom had stood on the second stone, it
cannot jump from the first stone to the third stone or from the n-the stone to the 4-th stone.
Please note that during the whole process, it was OK for the two rabbits to stand on a same stone at the same time.
Now they want to find out the maximum turns they can play if they follow the optimal strategy.
Input
The input contains at most 20 test cases.
For each test cases, the first line contains a integer n denoting the number of stones.
The next line contains n integers separated by space, and the i-th integer ai denotes the weight of the i-th stone.(1 <= n <= 1000, 1 <= ai <= 1000)
The input ends with n = 0.
Output
For each test case, print a integer denoting the maximum turns.
Sample Input
1 1 4 1 1 2 1 6 2 1 1 2 1 3 0
Sample Output
1 4 5 Hint For the second case, the path of the Tom is 1, 2, 3, 4, and the path of Jerry is 1, 4, 3, 2. For the third case, the path of Tom is 1,2,3,4,5 and the path of Jerry is 4,3,2,1,5.#include<stdio.h> #include<iostream> #include<string.h> #include<math.h> #define N 1010 using namespace std; int dp ,num ; int main(){ int n; while(scanf("%d",&n),n){ int i,j,k; memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++) cin>>num[i],dp[i][i]=1; for(i=n;i>0;i--){ for(j=i+1;j<=n;j++){ if(num[i]==num[j]) dp[i][j]=dp[i+1][j-1]+2; else dp[i][j]=max(dp[i][j-1],dp[i+1][j]); } } k=0; for(i=1;i<=n;i++) k=max(k,dp[1][i]+dp[i+1] ); cout<<k<<endl; } }
代码的灵魂不在于长度
相关文章推荐
- HDU 4745 Two Rabbits(最长回文子序列)(2013 ACM/ICPC Asia Regional Hangzhou Online)
- hdu 4745 Two Rabbits 2013 ACM/ICPC Asia Regional Hangzhou Online
- 2013 ACM/ICPC Asia Regional Hangzhou Online
- HDU 4739 Zhuge Liang's Mines (2013 ACM/ICPC Asia Regional Hangzhou Online)
- HDU 2013 ACM/ICPC Asia Regional Hangzhou Online ------ Zhuge Liang's Mines
- 2013 ACM/ICPC Asia Regional Hangzhou Online 个人总结
- hdu 4740 The Donkey of Gui Zhou 深搜(2013 ACM/ICPC Asia Regional Hangzhou Online 1003)
- HDU 4744 Starloop System(最小费用最大流)(2013 ACM/ICPC Asia Regional Hangzhou Online)
- HDU 4747 Mex(线段树)(2013 ACM/ICPC Asia Regional Hangzhou Online)
- HDU4747——2013 ACM/ICPC Asia Regional Hangzhou Online
- HDU4745——Two Rabbits——2013 ACM/ICPC Asia Regional Hangzhou Online
- hdu 4738 Caocao's Bridges 2013 ACM/ICPC Asia Regional Hangzhou Online tarjan 模板
- 2013 ACM/ICPC Asia Regional Hangzhou Online(解题报告) 正在更新
- hdu 4739 Zhuge Liang's Mines 2013 ACM/ICPC Asia Regional Hangzhou Online
- 2013 ACM/ICPC Asia Regional Online —— Warmup1 1005 Balls Rearrangement
- 2013 ACM/ICPC Asia Regional Online — Warmup 个人总结
- HDU 4722 Good Numbers(位数DP)(2013 ACM/ICPC Asia Regional Online ―― Warmup2)
- 2013 ACM/ICPC Asia Regional Chengdu Online
- 2013 ACM/ICPC Asia Regional Nanjing Online hdu 4751 补图+二分图染色判定
- 2013 2013 ACM/ICPC Asia Regional Changsha Online - H Hypersphere