QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#134865	#6636. Longest Strictly Increasing Sequence	silly_1_2_3^#	AC ✓	8ms	3584kb	C++14	760b	2023-08-05 09:28:59	2023-08-05 09:29:01

Judging History

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

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

[2023-08-05 09:29:01]
评测

测评结果：AC
用时：8ms
内存：3584kb

查看

[2023-08-05 09:28:59]
提交

answer

#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),i##z=(b);i<=i##z;i++)
#define ROF(i,a,b) for(int i=(a),i##z=(b);i>=i##z;i--)
#define REP(i,u) for(int i=hd[u],v;v=to[i],i;i=nxt[i])
#define temT template<typename T>
#define temT12 template<typename T1,typename T2>
using namespace std;
typedef long long ll;
typedef long double ld;

const int N=int(1e2)+10;

int T,n,b[N],a[N];

int main(){
	for(cin>>T;T--;){
		cin>>n; FOR(i,1,n) cin>>b[i];
		if(b[1]!=1){ cout<<"NO\n"; continue; }
		a[1]=1; bool flag=false;
		FOR(i,2,n)
			if(b[i]==b[i-1]+1) a[i]=a[i-1]+1;
			else if(b[i]==b[i-1]) a[i]=a[i-1];
			else{ flag=true; break; }
		if(flag){ cout<<"NO\n"; continue; }
		cout<<"YES\n"; FOR(i,1,n) cout<<a[i]<<" ";
	}
	return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3448kb

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

memory: 3584kb

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 3 3 3 3 ...

result:

ok t=3483 (3483 test cases)