QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#226209	#6636. Longest Strictly Increasing Sequence	xuxubaobao	AC ✓	2ms	5740kb	C++17	811b	2023-10-25 18:24:26	2023-10-25 18:24:26

Judging History

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

[2023-10-25 18:24:26]
评测

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

查看

[2023-10-25 18:24:26]
提交

answer

#include <bits/stdc++.h>

using namespace std;
using PII = pair<int,int>;
using ll = long long;

constexpr int N = 2e6 + 10;

int w[N];
int s[N];
void solve() {
	int n;
	cin >> n;
	for(int i = 1; i <= n; i ++) {
		cin >> w[i];
	}
	int flag = 1;
	for(int i = 1; i <= n; i ++) {
		bool ok = 0;
		for(int j = 0; j < i; j ++) {
			if(w[j] == w[i] - 1) {
				ok = 1;
				break;
			}
		}
		for(int j = 0; j < i; j ++) {
			if(w[i] < w[j]) {
				ok = 0;
			}
		}
		if(!ok) flag = 0;
	}
	if(!flag) {
		cout << "NO" << "\n";
	}
	else {
		cout << "YES" << "\n";
		for(int i = 1; i <= n; i ++) {
			cout << w[i] << " ";
		}
		cout << "\n";
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	t = 1;
	cin >> t;
	while(t --){
		solve();
	}
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 5740kb

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

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)