/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 324.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 1ms 532.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Accepted 1ms 532.0 KiB
#8 Accepted 2ms 532.0 KiB
#9 Accepted 3ms 324.0 KiB
#10 Accepted 4ms 532.0 KiB
#11 Accepted 4ms 320.0 KiB
#12 Accepted 4ms 532.0 KiB
#13 Accepted 4ms 532.0 KiB
#14 Accepted 4ms 532.0 KiB
#15 Accepted 4ms 532.0 KiB
#16 Accepted 4ms 324.0 KiB
#17 Accepted 4ms 532.0 KiB
#18 Accepted 4ms 536.0 KiB
#19 Accepted 4ms 532.0 KiB
#20 Accepted 4ms 532.0 KiB
#21 Accepted 7ms 532.0 KiB
#22 Accepted 36ms 1.57 MiB
#23 Accepted 16ms 1.77 MiB
#24 Accepted 18ms 2.066 MiB
#25 Accepted 33ms 3.195 MiB
#26 Accepted 11ms 1.773 MiB
#27 Accepted 10ms 784.0 KiB
#28 Accepted 37ms 1.973 MiB
#29 Accepted 20ms 2.02 MiB
#30 Accepted 26ms 3.02 MiB
#31 Accepted 50ms 2.52 MiB
#32 Accepted 48ms 3.312 MiB
#33 Accepted 19ms 2.77 MiB
#34 Accepted 50ms 2.309 MiB
#35 Accepted 24ms 3.52 MiB

Code

#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;

const int mod = 998244353;
const int inf = 1e9 + 20;
const int N = 1e5+5;

int32_t main(){
    cin.tie(0); cout.tie(0);
    ios_base::sync_with_stdio(false);
    int n, k;
    cin>>n>>k;
    vector<int> a(n), b(n);
    for(int i = 0; i < n; i++){
        cin>>a[i];
    }
    b = a;
    sort(b.begin(), b.end());
    int l = n-1, r = 0;
    for(int i = 0; i < n; i++){
        if(a[i] != b[i]){
            l = min(l, i);
            r = max(r, i);
        }
    }

    if(r - l + 1 <= k){
        cout<<"YES"<<endl;
        cout<<l+1<<" "<<r+1<<endl;
    }
    else{
        cout<<"NO"<<endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1120 Stairway to the Skyline
Contest
Brain Booster #7
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 15:08:03
Judged At
2024-11-05 15:08:03
Judged By
Score
100
Total Time
50ms
Peak Memory
3.52 MiB