Submission #3008052

---

Source Code Expand

#include <stdio.h>
#include <string>
#include <iostream>
#include <map>
using namespace std;

int main(void){
    int n,k,count;
    int rnk[100005],rvr[100005];
    int check[100005];
    cin >> n >>k;
    for(int i=1; i<=n; i++){
        cin >> rnk[i];
        rvr[rnk[i]]=i;
    }
    int max=0,temp;
    for(int i=1; i<=k; i++){
        check[rnk[i]]=1;
        if(max<rnk[i])max=rnk[i],temp=i;
    }
    printf("%d\n",temp);
    int l=temp;
    for(int i=k+1; i<=n; i++){
        
        check[rnk[i]]=1;
        if(rnk[l]>rnk[i]){
            count=0;
            l=rvr[rnk[l]+(--count)];
            while(!check[rnk[l]+(count)])k=rvr[rnk[l]+(--count)];
            printf("count%d\n",count);
        }
        printf("%d\n",l);
    }
    return 0;
}

Submission Info

Judge Result