QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#466195	#6636. Longest Strictly Increasing Sequence	ucup-team191^#	AC ✓	2ms	3680kb	C++14	1.3kb	2024-07-07 16:52:01	2024-07-07 16:52:02

Judging History

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

[2024-07-07 16:52:02]
评测

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

查看

[2024-07-07 16:52:01]
提交

answer

#include<bits/stdc++.h>

using namespace std;

typedef long long llint;
typedef pair <int, int> pi;

const int MAXN = 15;

int t, n, mx;
int b[MAXN], a[MAXN], dp[MAXN];

void povecaj (int val, int k) {
    for (int i = 1; i <= k; i++) {
        if (a[i] >= val) a[i]++;
    }
    for (int i = 1; i <= mx; i++) {
        if (dp[i] >= val) dp[i]++;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> t;
    while (t--) {
        cin >> n;
        mx = 0;
        memset(dp, 0, sizeof dp);
        bool ok = 1;
        for (int i = 1; i <= n; i++) {
            cin >> b[i];
            if (b[i] < b[i - 1]) ok = 0;
            if (b[i] > mx + 1) {
                ok = 0;
            }
            if (b[i] <= mx) {
                int val = dp[b[i]];
                povecaj(val, i);
                a[i] = val;
                dp[b[i]] = val;
            } else {
                mx = b[i];
                a[i] = i;
                dp[mx] = i;
            }
        }
        if (ok) {
            cout << "YES\n";
            for (int i = 1; i <= n; i++) {
                cout << a[i] << " ";
            }
            cout << '\n';
        } else {
            cout << "NO\n";
        }
    }
    return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3556kb

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

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

result:

ok t=3483 (3483 test cases)