QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#127062	#6636. Longest Strictly Increasing Sequence	Vriance^#	AC ✓	2ms	3852kb	C++14	1003b	2023-07-19 12:44:10	2023-07-19 12:44:12

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 12:44:12]
评测

测评结果：AC
用时：2ms
内存：3852kb

查看

[2023-07-19 12:44:10]
提交

answer

#include <iostream>
#include <cstdio>
#include <cmath>
#include <map>
#include <algorithm>
#include <vector>
#include <cctype>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn=500005;
const int INF=0x7f7f;

inline int read(){
    int x=0,w=1;char c=getchar();
    for(;!isdigit(c);c=getchar())if(c=='-')w=-1;
    for(;isdigit(c);x=(x<<3)+(x<<1)+c-'0',c=getchar());
    return x*w;
}

inline ll readll(){
    ll x=0,w=1;char c=getchar();
    for(;!isdigit(c);c=getchar())if(c=='-')w=-1;
    for(;isdigit(c);x=(x<<3)+(x<<1)+c-'0',c=getchar());
    return x*w;
}

ll n,m,b[15],a[15];

int main(){
	int t=read();
	for(;t--;){
		n=read();
		ll mx=0,f=0;
		for(int i=1;i<=n;i++){
			b[i]=read(),a[i]=b[i];
			if(f)continue;
			if(b[i-1]>b[i]||b[i]>b[i-1]+1){
				f=1;
			}
		}
		if(f)printf("NO\n");
		else {
			printf("YES\n");
			for(int i=1;i<=n;i++){
				printf("%lld ",a[i]);
			}
			putchar('\n');
		}
	} 
	
	
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3852kb

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

memory: 3616kb

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)