题目链接
A. Tanya and Stairways
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 33 steps, 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.
Input
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.
Output
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.
Examples
input
Copy
7 1 2 3 1 2 3 4
output
Copy
2 3 4
input
Copy
4 1 1 1 1
output
Copy
4 1 1 1 1
input
Copy
5 1 2 3 4 5
output
Copy
1 5
input
Copy
5 1 2 1 2 1
output
Copy
3 2 2 1
代码实现：
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<sstream>
#include<iterator>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<deque>
#include<queue>
#include<list>
using namespace std;
const double eps = 1e-8;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 0x3f3f3f3f;
const int INT_M_INF = 0x7f7f7f7f;
const LL LL_INF = 0x3f3f3f3f3f3f3f3f;
const LL LL_M_INF = 0x7f7f7f7f7f7f7f7f;
const int dr[] = {0, 0, -1, 1, -1, -1, 1, 1};
const int dc[] = {-1, 1, 0, 0, -1, 1, -1, 1};
const int MOD = 1e9 + 7;
const double pi = acos(-1.0);
const int MAXN=5010;
const int MAXM=100010;
const int M=50010;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int a[1010];
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int b[1010],j=0;
int sum=1;
memset(b,0,sizeof(b));
for(int i=1;i<n;i++)
{
if(a[i+1]>a[i])
{
b[sum]++;
}
else
sum++;
}
cout<<sum<<endl;
for(int i=1;i<sum;i++)
cout<<b[i]+1<<" ";
cout<<b[sum]+1<<endl;
}
return 0;
}
