A. Tanya and Stairways
Little girl Tanya climbs the stairs inside a multi-storey building. Every time Tanya climbs a stairway, she starts counting steps from 11 to the number of steps in this stairway. She speaks every number aloud. For example, if she climbs two stairways, the first of which contains 33steps, and the second contains 44 steps, she will pronounce the numbers 1,2,3,1,2,3,41,2,3,1,2,3,4.
You are given all the numbers pronounced by Tanya. How many stairways did she climb? Also, output the number of steps in each stairway.
The given sequence will be a valid sequence that Tanya could have pronounced when climbing one or more stairways.
The first line contains nn (1≤n≤10001≤n≤1000) — the total number of numbers pronounced by Tanya.
The second line contains integers a1,a2,…,ana1,a2,…,an (1≤ai≤10001≤ai≤1000) — all the numbers Tanya pronounced while climbing the stairs, in order from the first to the last pronounced number. Passing a stairway with xx steps, she will pronounce the numbers 1,2,…,x1,2,…,x in that order.
The given sequence will be a valid sequence that Tanya could have pronounced when climbing one or more stairways.
In the first line, output tt — the number of stairways that Tanya climbed. In the second line, output tt numbers — the number of steps in each stairway she climbed. Write the numbers in the correct order of passage of the stairways.
7 1 2 3 1 2 3 4
2 3 4
4 1 1 1 1
4 1 1 1 1
5 1 2 3 4 5
1 5
5 1 2 1 2 1
3 2 2 1
Codeforces (c) Copyright 2010-2018 Mike Mirzayanov
题意:给出一个长为n的数列,求上升子串的个数,以及每个上升子串的长度(保证每个上升子串都从1开始,并且每次递增1)
思路:由于输入保证从一开始,那么,输入时,如果为一,那么开始计数,碰到下一个1,重置,然后重新计数即可
#include "iostream"
using namespace std;
int ans[1005];
int main()
{
int n,x,t,cnt;
cin>>n;
t=0;
for(int i=0;i<n;i++){
cin>>x;
if(x==1) ans[t++]=cnt,cnt=0;
cnt++;
}
ans[t]=cnt;
cout<<t<<endl;
for(int i=1;i<=t;i++) cout<<ans[i]<<" ";
cout<<endl;
return 0;
}