QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#173994	#6636. Longest Strictly Increasing Sequence	cada_dia_mas_insanos^#	AC ✓	15ms	3484kb	C++17	1.1kb	2023-09-10 03:31:20	2023-09-10 03:31:21

Judging History

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

[2023-09-10 03:31:21]
评测

测评结果：AC
用时：15ms
内存：3484kb

查看

[2023-09-10 03:31:20]
提交

answer

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif // LOCAL

    int tt; cin >> tt;
    while (tt--) {
        int n; cin >> n;
        vector <int> b(n);
        for (int i=0; i<n; i++) cin >> b[i];
        vector <int> a(n);
        if (b[0] != 1) {
            cout << "NO" << endl;
            continue;
        }
        bool ok = 1;
        a[0] = 1;
        int last = 1;
        for (int i=1; i<n; i++) {
            if (b[i] > b[i-1]) {
                if (b[i] > b[i-1]+1) {
                    ok=0;
                    break;
                } else a[i]=++last;
            } else if (b[i] == b[i-1]) a[i] = last;
            else {
                ok=0;
                break;
            }
        }
        if (!ok) cout << "NO" << endl;
        else {
            cout << "YES" << endl;
            for(int i=0; i < n; i++) cout << a[i] << ' ';
            cout << endl;
        }
    }

    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3484kb

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

memory: 3468kb

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)