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 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
inputCopy
7
1 2 3 1 2 3 4
outputCopy
2
3 4
inputCopy
4
1 1 1 1
outputCopy
4
1 1 1 1
inputCopy
5
1 2 3 4 5
outputCopy
1
5
inputCopy
5
1 2 1 2 1
outputCopy
3
2 2 1

后台第五组测试是 n = 1(特殊值）

#include <iostream>
#include <cstdio>
using namespace std;

int a[1005];
int ans[1005];

int main()
{
    int n;
    while(cin >> n)
    {
        if(n == 1)
        {
            int b;
            cin >> b;
            cout << '1' << '\n' << '1' << '\n';
            continue;
        }
        for(int i = 0; i < n; ++i)
            cin >> a[i];
        int tot = 1;
        for(int i = 1; i < n - 1; ++i)
            if(a[i] == 1)
                ans[tot++] = a[i - 1];
        if(a[n - 1] == 1)
        {
            ans[tot] = a[n - 2];
            tot++;
            ans[tot] = 1;
        }
        if(a[n - 1] != 1)
            ans[tot] = a[n - 1];
        cout << tot  << '\n';
        for(int i = 1; i <= tot; ++i)
            cout << ans[i] << ' ';
        cout << '\n';
    }
    return 0;
}