QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#127001#6636. Longest Strictly Increasing Sequenceshielder#AC ✓5ms3444kbC++14677b2023-07-19 12:11:522023-07-19 12:11:55

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-19 12:11:55]
  • 评测
  • 测评结果:AC
  • 用时:5ms
  • 内存:3444kb
  • [2023-07-19 12:11:52]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
int a[N], b[N];
int n;
int main(){
   int tt;
   cin >> tt;
   while(tt--){
    cin >> n;
    bool f = 1;
    int mx = 1;
    for(int i = 1;i <= n;i++){
        cin >>b[i];
        if(b[i] < b[i-1] || b[i] > i || b[i] > b[i-1] +1 ){
            f = 0;
        }
        else if(b[i] == b[i-1]){
            a[i] = a[i-1];
        }
        else{
            a[i] = mx++;
        }
    }
    if(f == 0){
        cout << "NO\n";
        continue;
    }
    cout <<"YES\n";
    for(int i = 1;i <= n;i++){
        cout <<a[i] << " ";
    }
    cout << "\n";
   }
   return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3444kb

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: 5ms
memory: 3440kb

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)