QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#422035	#6636. Longest Strictly Increasing Sequence	liuzhenhao09^#	AC ✓	0ms	3972kb	C++20	686b	2024-05-26 17:04:30	2024-05-26 17:04:30

Judging History

你现在查看的是最新测评结果

[2024-05-26 17:04:30]
评测

测评结果：AC
用时：0ms
内存：3972kb

查看

[2024-05-26 17:04:30]
提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
int T,n;
int b[20];
signed main(){
	scanf("%lld",&T);
	while(T--){
		scanf("%lld",&n);
		bool flag = 1;
		for(int i = 1; i <= n; i++) scanf("%lld",&b[i]);
		for(int i = 1; i < n; i++) if(b[i] > b[i + 1]) flag = 0;
		for(int i = 1; i <= n; i++) if(b[i] > i) flag = 0;
		if(b[1] != 1) flag = 0;
		for(int i = 1; i < n; i++) if(b[i] != b[i + 1] && b[i] + 1 != b[i + 1]) flag = 0;
		if(!flag){
			puts("NO");
			continue;
		}
		puts("YES");
		printf("1 ");
		int tmp = 1;
		for(int i = 2; i <= n; i++){
			if(b[i] != b[i - 1]) tmp++;
			printf("%lld ",tmp);
		}
		printf("\n");
	}
	return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3920kb

input:

2
6
1 2 3 2 5 7
2
1 2

output:

NO
YES
1 2

result:

ok t=2 (2 test cases)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3972kb

input:

3483
5
2 3 5 1 1
2
8 1
10
1 2 3 4 4 5 6 6 6 7
10
1 1 2 2 2 2 3 4 4 5
2
5 8
3
7 10 8
5
4 1 3 3 8
10
1 2 2 2 2 2 2 3 3 3
10
1 1 2 3 4 5 5 5 5 6
9
1 2 3 4 5 5 6 6 7
7
8 8 8 8 9 1 2
5
8 9 8 3 5
10
1 2 3 3 3 3 4 4 4 5
5
7 1 6 4 3
7
5 6 8 6 1 5 5
10
1 2 2 3 4 4 4 4 5 5
3
10 4 5
3
1 5 3
5
2 8 1 2 1
3
7 8 3...

output:

NO
NO
YES
1 2 3 4 4 5 6 6 6 7 
YES
1 1 2 2 2 2 3 4 4 5 
NO
NO
NO
YES
1 2 2 2 2 2 2 3 3 3 
YES
1 1 2 3 4 5 5 5 5 6 
YES
1 2 3 4 5 5 6 6 7 
NO
NO
YES
1 2 3 3 3 3 4 4 4 5 
NO
NO
YES
1 2 2 3 4 4 4 4 5 5 
NO
NO
NO
NO
NO
NO
YES
1 1 1 2 2 3 3 4 4 
NO
NO
NO
NO
NO
NO
NO
YES
1 2 3 3 3 4 4 4 5 5 
YES
1 1 2 2 2...

result:

ok t=3483 (3483 test cases)