1005A. 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 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

( 1n1000

) — the total number of numbers pronounced by Tanya.

The second line contains integers a1,a2,,an

( 1ai1000) — 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.

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 

题意:Tanya每走一级楼梯就会报数,每走新的一层将从1报,输出Tanya一共走了几层楼梯,分别有多少

级楼梯

思路:当遇到1表示走到了新的一层楼梯,前边的一个数为前一层共有的阶梯级数

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int N = 1005;
int a[N],b[N];
int main(){
	int n,pos=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
    	if(i==n||a[i]==1) b[pos++]=a[i-1];
	}
	printf("%d\n",pos);
	for(int i=0;i<pos-1;i++)
	   printf("%d ",b[i]);
	printf("%d\n",b[pos-1]);
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值