QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#139722#6636. Longest Strictly Increasing Sequencesyx2567AC ✓2ms3880kbC++14462b2023-08-14 12:17:032023-08-14 12:17:04

Judging History

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

  • [2023-08-14 12:17:04]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3880kb
  • [2023-08-14 12:17:03]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int T,n,a[N];
bool check()
{
	if(a[1]!=1) return false;
	for(int i=2;i<=n;i++)
		if(a[i]-a[i-1]>1||a[i]-a[i-1]<0) return false;
	return true;
}
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		if(!check()){printf("NO\n");continue;}
		printf("YES\n");
		for(int i=1;i<=n;i++) printf("%d ",a[i]);
		printf("\n");
	}
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3880kb

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

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)