Tanya and Stairways CodeForces - 1005A （水题）_codeforce1005a题解-优快云博客

本文链接：https://blog.youkuaiyun.com/qq_41874469/article/details/80981634

本文详细介绍了Tanya攀登楼梯时数步数的情况，给出了一串她念出的数字，并要求根据这些数字推断出她爬了多少段楼梯以及每段楼梯有多少级。题目解析中提到了如何从给定的数字序列中找出连续上升的子序列，即楼梯的级数，并给出了解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 $1$ 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 $3$ steps, and the second contains $4$ steps, she will pronounce the numbers $1, 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 $n$ ( $1 \leq n \leq 1000$ ) — the total number of numbers pronounced by Tanya.

The second line contains integers $a_{1}, a_{2}, \dots, a_{n}$ ( $1 \leq a_{i} \leq 1000$ ) — all the numbers Tanya pronounced while climbing the stairs, in order from the first to the last pronounced number. Passing a stairway with $x$ steps, she will pronounce the numbers $1, 2, \dots, 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 $t$ — the number of stairways that Tanya climbed. In the second line, output $t$ 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

题意：给出一个长为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;
}