Codeforces Beta Round #63 (Div. 2) E题

//今天学会了一句"有木有" 和一句 "坑爹"

//第一次被hack掉,有木有!

//stl是锦上添花,不是雪中送炭,坑爹呀!

 

 

#include <iostream> #include <cstdio> #include <map> #include <set> using namespace std; const int MAX=100005; int a[MAX]; map<int,int> myMap; set<int> mySet; int main(){ int n,k; //freopen("i.txt","r",stdin); cin>>n>>k; for(int i=1;i<=n;i++){ cin>>a[i]; myMap[a[i]]=0; } for(int i=1;i<k;i++){ myMap[a[i]]++; if(myMap[a[i]]==1) mySet.insert(a[i]); if(myMap[a[i]]==2){ mySet.erase(a[i]); } } for(int i=k;i<=n;i++){ myMap[a[i]]++; if(myMap[a[i]]==1) mySet.insert(a[i]); if(myMap[a[i]]==2){ mySet.erase(a[i]); //myMap[a[i]]=0; } if(mySet.size()==0) cout<<"Nothing"<<endl; else cout<<*mySet.rbegin()<<endl; //cout<<"S<<"<<endl; myMap[a[i-k+1]]--; if(myMap[a[i-k+1]]==1) mySet.insert(a[i-k+1]); if(myMap[a[i-k+1]]==0) mySet.erase(a[i-k+1]); } }