QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#266390	#6636. Longest Strictly Increasing Sequence	Hongzy	AC ✓	0ms	3608kb	C++17	904b	2023-11-26 13:36:49	2023-11-26 13:36:49

Judging History

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

[2023-11-26 13:36:49]
评测

测评结果：AC
用时：0ms
内存：3608kb

查看

[2023-11-26 13:36:49]
提交

answer

#include <bits/stdc++.h>
#define rep(i, j, k) for(int i = j; i <= k; ++ i)
#define per(i, j, k) for(int i = j; i >= k; -- i)
using namespace std;
using ll = long long;
const int N = 20;
int n, b[N], a[N];
int main() {
    int test;
    scanf("%d", &test);
    rep(T, 1, test) {
        scanf("%d", &n);
        rep(i, 1, n) scanf("%d", b + i);
        bool ok = true;
        b[0] = 0;
        rep(i, 0, n - 1) ok &= b[i+1] == b[i] || b[i+1] == b[i]+1;
        if(!ok) {
            puts("NO");
            continue;
        }
        puts("YES");
        int v = 0;
        for(int i = 1, j; i <= n; i = j + 1) {
            j = i;
            while(j < n && b[j+1] == b[j]) ++j;
            for(int k = j; k >= i; k --) {
                a[k] = ++v;
            }
        }
        rep(i, 1, n)
            printf("%d%c", a[i], " \n"[i == n]);
    }    
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3552kb

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

memory: 3608kb

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

result:

ok t=3483 (3483 test cases)