CodeForces 39B Company Income Growth
来源:互联网 发布:unity3d 寻路插件 编辑:程序博客网 时间:2024/06/08 11:13
Petya works as a PR manager for a successful Berland company BerSoft. He needs to prepare a presentation on the company income growth since2001 (the year of its founding) till now. Petya knows that in2001 the company income amounted to a1 billion bourles, in 2002 — to a2 billion, ..., and in the current(2000 + n)-th year — an billion bourles. On the base of the information Petya decided to show in his presentation the linear progress history which is in his opinion perfect. According to a graph Petya has already made, in the first year BerSoft company income must amount to 1 billion bourles, in the second year —2 billion bourles etc., each following year the income increases by1 billion bourles. Unfortunately, the real numbers are different from the perfect ones. Among the numbersai can even occur negative ones that are a sign of the company’s losses in some years. That is why Petya wants to ignore some data, in other words, cross some numbersai from the sequence and leave only some subsequence that has perfect growth.
Thus Petya has to choose a sequence of years y1,y2, ..., yk,so that in the year y1 the company income amounted to 1 billion bourles, in the year y2 —2 billion bourles etc., in accordance with the perfect growth dynamics. Help him to choose the longest such sequence.
The first line contains an integer n (1 ≤ n ≤ 100). The next line containsn integers ai ( - 100 ≤ ai ≤ 100). The numberai determines the income of BerSoft company in the(2000 + i)-th year. The numbers in the line are separated by spaces.
Output k — the maximum possible length of a perfect sequence. In the next line output the sequence of yearsy1, y2, ..., yk. Separate the numbers by spaces. If the answer is not unique, output any. If no solution exist, output one number0.
10-2 1 1 3 2 3 4 -10 -2 5
52002 2005 2006 2007 2010
3-1 -2 -3
0注意年份是从小到大排列。#include<iostream>using namespace std;struct income_amounted{ int income; int year;}company[110];int main(){ int n,k,t,flag,num[110]; while(cin>>n){ k=t=flag=0; for(int i=1;i<=n;i++){ cin>>company[i].income; company[i].year=i; } for(int i=1;;i++){ flag=0; for(int j=t+1;j<=n;j++){ if(company[j].income==i){ flag=1; num[k]=company[j].year; k++; t=j; break; } } if(flag==0){ break; } } cout<<k<<endl; for(int i=0;i<k;i++){ if(i!=(k-1)){ cout<<num[i]+2000<<" "; } else{ cout<<num[i]+2000<<endl; } } } return 0;}
- CodeForces 39B Company Income Growth
- Company Income Growth
- Codeforces Round #321 B Kefa and Company
- codeforces-580B Kefa and Company(二分)
- CodeForces 580B Kefa and Company
- Codeforces 580B Kefa and Company
- 【CodeForces】[580B]Kefa and Company
- CodeForces 580B Kefa and Company
- CodeForces 580B Kefa and Company
- 【CodeForces 580B】Kefa and Company
- codeforces 580B Kefa and Company
- Codeforces Round #321 (Div. 2)B. Kefa and Company
- Codeforces Round #321 (Div. 2) B. Kefa and Company
- Codeforces Round #321 (Div. 2) 580B. Kefa and Company
- Codeforces Round #321 (Div. 2)B. Kefa and Company
- CodeForces 580B Kefa and Company <贪心>
- 【CodeForces】580B - Kefa and Company(二分)
- Codeforces 580B: Kefa and Company(尺取法)
- LBS-Object C 定位,地图,导航
- 未来趋势
- a类、b类、c类地址
- 一个错误
- Android 的性能工具用法 II-内存分析工具I
- CodeForces 39B Company Income Growth
- 1083. List Grades (25)
- Pig 初识
- 链队列的基本操作
- Bootstrap多级导航栏(级联导航)的实现代码
- 消除“Permission is only granted to system apps”错误
- HDU5605——数学题(三角函数的应用)
- iOS学习----------图片的简单处理(2)
- socket访问百度