Submission #223825

---

Source Code Expand

#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;

int N,K;
int X[100005];
vector<P> vec;
int main() {
    cin>>N>>K;
    rep(i,N) cin>>X[i];
    rep(i,K) {
        vec.pb(P(X[i],i+1));
    }
    sort(all(vec));
    rep(i,N-K+1) {
        //rep(j,vec.size()) {
        //    cout<<vec[j].fr<<","<<vec[j].sc<<endl;
        //}
        cout<<vec[K-1].sc<<endl;
        vec.pb(P(X[i+K],i+K+1));
        sort(all(vec));

    }

    return 0;
}

Submission Info

Judge Result