/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 328.0 KiB
#2 Accepted 1ms 480.0 KiB
#3 Accepted 2ms 432.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 1ms 324.0 KiB
#6 Accepted 1ms 768.0 KiB
#7 Accepted 2ms 532.0 KiB
#8 Accepted 1ms 548.0 KiB
#9 Accepted 1ms 320.0 KiB
#10 Accepted 1ms 480.0 KiB
#11 Accepted 1ms 388.0 KiB
#12 Accepted 1ms 512.0 KiB
#13 Accepted 1ms 352.0 KiB
#14 Accepted 2ms 764.0 KiB
#15 Accepted 1ms 532.0 KiB
#16 Accepted 1ms 536.0 KiB
#17 Accepted 1ms 536.0 KiB
#18 Accepted 1ms 324.0 KiB
#19 Accepted 2ms 324.0 KiB
#20 Accepted 1ms 532.0 KiB
#21 Accepted 2ms 576.0 KiB
#22 Accepted 16ms 1.117 MiB
#23 Accepted 17ms 1.164 MiB
#24 Accepted 18ms 1.242 MiB
#25 Accepted 35ms 1.812 MiB
#26 Accepted 11ms 1.133 MiB
#27 Accepted 3ms 580.0 KiB
#28 Accepted 18ms 1.156 MiB
#29 Accepted 18ms 1.199 MiB
#30 Accepted 21ms 1.738 MiB
#31 Accepted 27ms 1.574 MiB
#32 Accepted 25ms 1.719 MiB
#33 Accepted 19ms 1.621 MiB
#34 Accepted 23ms 1.242 MiB
#35 Accepted 25ms 2.059 MiB

Code

#include<bits/stdc++.h>
using namespace std;
const long long M=2e5+10,MOD=998244353;
typedef long long ll;
#define debug(x) cout<<x<<endl

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
   // cin>>t;
    while(t--){
    	int n,k;
    	cin>>n>>k;
    	vector<int>a(n);
    	for(auto &i:a)cin>>i;
    	vector<int>d=a;
    	sort(d.begin(),d.end());
    	int l=0,r=0;
    	for(int i=0;i<n;i++){
    		if(a[i]!=d[i]){
    			l=i;
    			break;
    		}
    	}
    	for(int i=n-1;i>=0;i--){
    		if(a[i]!=d[i]){
    			r=i;
    			break;
    		}
    	}
    	if(r-l+1>k){
    		cout<<"NO\n";
    	}
    	else{
    		cout<<"YES\n";
    		cout<<l+1<<" "<<r+1<<"\n";
    	}
     

    }
    

    
    return 0;
 
}

Information

Submit By
Type
Submission
Problem
P1120 Stairway to the Skyline
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-07 20:22:53
Judged At
2024-12-17 11:26:04
Judged By
Score
100
Total Time
35ms
Peak Memory
2.059 MiB