QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#127698	#6636. Longest Strictly Increasing Sequence	xiaoxing666	AC ✓	3ms	3628kb	C++17	826b	2023-07-19 22:22:20	2023-07-19 22:22:21

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-07-19 22:22:21]
评测

测评结果：AC
用时：3ms
内存：3628kb

查看

[2023-07-19 22:22:20]
提交

answer

#include<bits/stdc++.h>

using namespace std;

int main()
{
	int t;
	scanf("%d" ,&t);
	while(t--)
	{
		int n;
		scanf("%d", &n);
		int f = 1;
		vector<int> b(n + 1), a(n + 1);
		for(int i = 1; i <= n; i++)
		{
			scanf("%d", &b[i]);
			if(b[i] > i){
				f = 0;
			}
			if(b[i] < b[i - 1])
			{
				f = 0;
			}
			if(b[i] - b[i - 1] >= 2)
			{
				f = 0;
			}
		}
		if(f == 0)
		{
			puts("NO");
			continue;
		}
		else{
			puts("YES");
			// a[1] = 1;
			// printf("%d ", a[1]);
			// for(int i = 2; i <= n; i++)
			// {
			// 	if(b[i] == b[i - 1])
			// 	{
			// 		a[i] = a[i - 1];
			// 	}
			// 	else{
			// 		a[i] = a[i - 1] + 1;
			// 	}
			// 	printf("%d ", a[i]);
			// }
			for(int i = 1; i <= n; i++)
				cout << b[i] << " ";
			puts("");
		}

	}

	return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3528kb

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: 3ms

memory: 3628kb

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)