Codeforces 724D Dense Subsequence(贪心)

$给你一个字符串，然后给你一个m，让你选出一些字符，让所有的[j,j+m-1]的区间内都至少有一个被选字符$
$同时要求选出来的字符，重组之后的串字典序最小$
$水题，随便贪心长度m的区间里最小的，选一下$
$记录一下最大的字符和最大的出现次数，然后小的全放进去就好了$

---

代码：

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")

using namespace std;
#define   MAX           100005
#define   MAXN          1000005
#define   maxnode       105
#define   sigma_size    30
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
//const double inf   = 1e18;
const double eps   = 1e-6;
const LL     mod   = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/

char s[MAX];
vector<char> v;
int nxt[MAX];
int num[MAX];
int main(){
    int m;
    while(~scanf("%d%s",&m,s)){
        int len=strlen(s);
        mem(nxt,-1);
        mem(num,0);
        set<pair<char,int> > se;
        for(int i=len-1;i>=0;i--){
            num[s[i]-'a']++;
            if(se.size()>=m){
                se.erase(mk(s[i+m],-(i+m)));
            }
            se.insert(mk(s[i],-i));
            set<pair<char,int> >::iterator it=se.begin();
            nxt[i]=-it->second;
        }
        v.clear();
        char maxn='a';
        for(int i=0;i<len;){
            if(len-i<m){
                break;
            }
            v.push_back(s[nxt[i]]);
            num[s[nxt[i]]-'a']--;
            maxn=max(maxn,s[nxt[i]]);
            i=nxt[i]+1;
        }
        for(int i=0;i<(maxn-'a');i++){
            while(num[i]){
                v.push_back((char)('a'+i));
                num[i]--;
            }
        }
        sort(v.begin(),v.end());
        for(int i=0;i<v.size();i++) printf("%c",v[i]);
        cout<<endl;
    }
    return 0;
}