Submission #3792201

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define INF 1000000007
#define SMO -1000000007
#define P pair<int,int>
#define fi first
#define se second
using namespace std;
bool prime(int n){
	for(int i=2;i<=sqrt(n);i++){
		if(n%i==0)return false;
	}
	return n!=1;
}
int kaicnt;
int kai(int n,int x){
	kaicnt++;
	if(kaicnt==x){
		kaicnt=0;
		return n%INF;
	}
	return (kai(n-1,x)%INF*n)%INF;
}
int conbi(int n,int x){
	x=min(x,n-x+1);
	return kai(n,x)/kai(x,x);
}
int pow_mod(int n,int k,int m){
	if(k==0)return 1;
	else if(k%2==1)return pow_mod(n,k-1,m)*n%m;
	else {
		int t=pow_mod(n,k/2,m);
		return t*t%m;
	}
}
int n,k,a[100005];
priority_queue<P>q;
signed main(){
	cin>>n>>k;
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	for(int i=0;i<k;i++)q.push({a[i],i});
	cout<<q.top().second+1<<endl;
	for(int i=k;i<n;i++){
		if(q.top().first>a[i]){
			q.pop();
			q.push({a[i],i});
		}
		cout<<q.top().second+1<<endl;
	}
}

Submission Info

Judge Result