7.31D Little girl Tanya climbs the stairs

最新推荐文章于 2018-12-28 10:05:38 发布

原创最新推荐文章于 2018-12-28 10:05:38 发布 · 386 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，用于解析一个整数序列，该序列由一个攀登楼梯的小女孩Tanya朗读。通过分析这些数字，可以确定Tanya攀爬了多少段楼梯以及每段楼梯的台阶数量。文章提供了一个C++代码实现，展示了如何处理输入数据并得出所需答案。

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

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≤n≤1000) — the total number of numbers pronounced by Tanya.

The second line contains integers a1,a2,…,an (1≤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 x steps, she will pronounce the numbers 1,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 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.

思路：由于输入都是从1开始，因此输出第一行计数为1的个数，碰到下一个1时重置。

#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<iomanip>
#include<list>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<set>
#include<vector>
using namespace std;
int a[1001],n,i,x,j,cnt,t;
int main()
{
   t=0;
   cin>>n;
   for(i=1;i<=n;i++)
   {
       cin>>x;
       if(x==1)
       a[t++]=cnt,cnt=0;
       cnt++;
   }
   a[t]=cnt;
   cout<<t<<endl;
   for(j=1;j<=t;j++)
   {
     cout<<a[j]<<" ";
   }
   return 0;
}