MG loves gold
来源:互联网 发布:罗马短剑 知乎 编辑:程序博客网 时间:2024/05/16 00:40
MG loves gold
Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 982 Accepted Submission(s): 420
Problem Description
MG is a lucky boy. He is always be able to find gold from underground.
It is known that the gold is a sequence withn elements, which has its own color C .
MG can dig out a continuous area of sequence every time by using one shovel, but he's unwilling to dig the golds of the same color with one shovel.
As a greedy person, he wish to take all the n golds away with least shovel.
The rules also require MG not to dig twice at the same position.
MG thought it very easy and he had himself disdained to take the job. As a bystander, could you please help settle the problem and calculate the answer?
It is known that the gold is a sequence with
MG can dig out a continuous area of sequence every time by using one shovel, but he's unwilling to dig the golds of the same color with one shovel.
As a greedy person, he wish to take all the n golds away with least shovel.
The rules also require MG not to dig twice at the same position.
MG thought it very easy and he had himself disdained to take the job. As a bystander, could you please help settle the problem and calculate the answer?
Input
The first line is an integer T which indicates the case number.(1<=T<=10 )
And as for each case, there are1 integer n in the first line which indicate gold-number(1<=n<=100000 ).
Then there aren integers C in the next line, the x-th integer means the x-th gold’s color(|C|<=2000000000 ).
And as for each case, there are
Then there are
Output
As for each case, you need to output a single line.
there should be one integer in the line which represents the least possible number of shovels after taking away alln golds.
there should be one integer in the line which represents the least possible number of shovels after taking away all
Sample Input
251 1 2 3 -151 1 2 2 3
Sample Output
23
#include<stdio.h>#include<math.h>#include<iostream>#include<string.h>#include<algorithm>using namespace std;int main(){ long long T,n,i,sum,j,k; long long a[100001]; while(scanf("%lld",&T)!=EOF) { while(T--) { sum=1; scanf("%lld",&n); for(i=0;i<n;i++) { scanf("%lld",&a[i]); } j=0;k=0; while(1) { j++; if(j>=n) break; for(i=j-1;i>=k;i--) { if(a[j]==a[i]) { sum++; k=j; break; } } } printf("%lld\n",sum); } } return 0;}
阅读全文
0 0
- HDU6019 MG loves gold
- MG loves gold
- Best Coder MG loves gold
- MG loves gold (map)
- HDOJ6019 MG loves gold 题解
- HDU 6019 MG loves gold
- HDU 6019 MG loves gold
- hdoj 6019 MG loves gold
- hdu 6019 MG loves gold
- HDU-6019 MG loves gold
- 【BestCoder Round #93】HDU6019 MG loves gold
- 【BestCoder Round #93】HDU6019 MG loves gold
- HDUoj -6019- MG loves gold (set
- BestCoder Round #93 MG loves gold hdu 6019
- HDU6020 MG loves apple
- HDU 6020 MG loves apple
- HD6019MG loves gold
- 【BestCoder Round #93】hdu6020 MG loves apple
- java从入门到弃坑十六夜
- FTRL的基础知识准备 part-1
- 任务栈
- fastjson: Release版本混淆异常问题
- Spring思维导图,让spring不再难懂(一)
- MG loves gold
- 软件开发需求分析内容
- oracle最多保留两位小数-补充
- Hive汇总统计数据自动化传输到Mysql数据库
- css自适应分页条制作
- 八.多态总结
- FTP
- div 指定时间消失
- 50596983