Algorithm

A. Tanya and Stairways
time limit per test
1 second
memory limit per test
256 megabytes
Problem link- https://codeforces.com/contest/1005/problem/A
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 n� (1≤n≤10001≤�≤1000) — the total number of numbers pronounced by Tanya.

The second line contains integers a1,a2,…,an�1,�2,…,�� (1≤ai≤10001≤��≤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,…,x1,2,…,� 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

 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int n, a[1001];
vector<int> sol;

int main() {
  scanf("%d", &n);
  for(int i = 0; i < n; ++i)
    scanf("%d", a + i);

  for(int i = 0, cnt; i < n - 1; ++i) {
    cnt = 0;
    while(i < n - 1 && a[i] < a[i + 1])
      ++cnt, ++i;
    sol.push_back(cnt + 1);
  }
  if(a[n - 1] == 1)
    sol.push_back(1);

  printf("%d\n", int(sol.size()));
  for(int i = 0; i < sol.size(); ++i)
    printf("%s%d", i == 0 ? "" : " ", sol[i]);
  puts("");

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
7
1 2 3 1 2 3 4

Output

x
–
+
cmd
2
3 4
Advertisements

Demonstration

Codeforces Solution-A. Tanya and Stairways-Solution in C, C++, Java, Python,Tanya and Stairways,Codeforces Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+