QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#174103	#6636. Longest Strictly Increasing Sequence	UNos_maricones^#	AC ✓	3ms	3908kb	C++14	904b	2023-09-10 04:12:23	2023-09-10 04:12:23

Judging History

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

[2023-09-10 04:12:23]
评测

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

查看

[2023-09-10 04:12:23]
提交

answer

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

#define ff   first
#define ss   second
#define pb   push_back

typedef long long   ll;
typedef pair<int,int>   ii;

const int N = 3e5+5;
const int mod = 1e9+7;

int arr[N];

int main() { 
	#ifdef LOCAL
		freopen("in.txt","r",stdin);
	#endif
	
	int t;
	scanf ( "%d", &t );
	while ( t-- ) {
		int n;
		bool flag = true;
		scanf ( "%d", &n );
		for ( int i = 0; i < n; ++i ) {
			scanf ( "%d", arr+i );
			flag &= i ? arr[i] == arr[i-1] || arr[i]-1 == arr[i-1] : true;
		}
		flag &= arr[0] == 1;
		if ( flag ) {
			printf ( "YES\n" );
			int cnt = 1;
			for ( int i = 0; i < n; ++i ) {
				if ( i and arr[i-1] < arr[i] ) {
					printf ( "%d", ++cnt );
				} else {
					printf ( "1" );
				}
				if ( i != n-1 ) printf ( " " );
			}
			printf ( "\n" );
		} else {
			printf ( "NO\n" );
		}
	}
	
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3908kb

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: 3908kb

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 1 5 6 1 1 7
YES
1 1 2 1 1 1 3 4 1 5
NO
NO
NO
YES
1 2 1 1 1 1 1 3 1 1
YES
1 1 2 3 4 5 1 1 1 6
YES
1 2 3 4 5 1 6 1 7
NO
NO
YES
1 2 3 1 1 1 4 1 1 5
NO
NO
YES
1 2 1 3 4 1 1 1 5 1
NO
NO
NO
NO
NO
NO
YES
1 1 1 2 1 3 1 4 1
NO
NO
NO
NO
NO
NO
NO
YES
1 2 3 1 1 4 1 1 5 1
YES
1 1 2 1 1 3 1 1 1 ...

result:

ok t=3483 (3483 test cases)