当前位置：网站首页>[CCF CSP] 201509-1 sequence segmentation

[CCF CSP] 201509-1 sequence segmentation

2022-07-22 04:00:00 【Jenny, Jenny】

Problem description

Question number ：201509-1
The title of the test question ： Sequence segmentation
The time limit ：1.0s
Memory limit ：256.0MB
Problem description ：

Problem description

　　 Give a sequence of integers , The longest continuous sequence of integers in a sequence is counted as a segment , How many segments are there in a sequence ？

Input format

　　 The first line of input contains an integer n, Represents the number of integers in a sequence .
　　 The second line contains n It's an integer a1, a2, …, an, Represents a given sequence of numbers , Adjacent integers are separated by a space .

Output format

　　 Output an integer , Indicates that a given sequence of numbers has multiple segments .

The sample input

8
8 8 8 0 12 12 8 0

Sample output

5

Sample explanation

　　8 8 8 It's the first paragraph ,0 It's the second paragraph ,12 12 It's the third paragraph , The penultimate integer 8 It's the fourth paragraph , the last one 0 It's the fifth paragraph .

Evaluate use case size and conventions

　　1 ≤ n ≤ 1000,0 ≤ ai ≤ 1000.

#include<bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	int** arr = new int*[m];
	for (int i = 0; i < m; i++)
	{
		arr[i] = new int[n];
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			cin >> arr[m - j - 1][i];
		}
	}
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cout<<arr[i][j]<<' ';
		}
		cout << endl;
	}
	return 0;
}

原网站

版权声明
本文为[Jenny, Jenny]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/07/202207211127030448.html

边栏推荐

猜你喜欢

随机推荐