【Codeforces 69 E Subsegments】

CF69E
题意 给你n个数字 让你每次从第一个开始取m个长度为一段
输出这一段中最大的出现次数为1次的个数
拿到这道题先想到 对于这种取m个长度为一段的 那么我肯定是先取m个
然后跑一遍 删掉前面的 加入后面的 这样就类似一个动态取m个的过程了
因为数据是 1e9 所以我们首先离散化
离散化以后我们用线段树去维护一下区间minn
先让所有的区间minn都是无穷大
如果插入一个未出现过的数 那么这个数出现minn就是 1
如果不断插入就是++，如果去掉就是 –
然后减到0 要把他恢复成 0x3f3f3f3f
然后对于查找坐标 我们只要找最右边的比他大的下标即可
一发入魂 实属意外

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 100025;
int arr[MAX_N],b[MAX_N];
map<int ,int > mp;
int minn[MAX_N<<2];
void up(int rt)
{
    minn[rt] = min(minn[rt<<1],minn[rt<<1|1]);
}
void build(int rt,int l,int r)
{
    minn[rt] = 0x3f3f3f3f;
    if(l==r)
    {
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void update(int rt,int l,int r,int x,int v)
{
    if(l==r)
    {
        if(minn[rt] == 0x3f3f3f3f)
        {
            minn[rt] = v;
        }
        else
        {
            minn[rt] += v;
            if(minn[rt]==0) minn[rt] = 0x3f3f3f3f;
        }
        return ;
    }
    if(x<=mid) update(rt<<1,l,mid,x,v);
    else update(rt<<1|1,mid+1,r,x,v);
    up(rt);
}
int query(int rt,int l,int r)
{
    if(l==r)
    {
        return l;
    }
    if(minn[rt]>1) return -1;
    if(minn[rt<<1|1]<=1) return query(rt<<1|1,mid+1,r);
    else if(minn[rt<<1]<=1) return query(rt<<1,l,mid);
    return -1;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m;scanf("%d%d",&n,&m);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i]),b[i] =arr[i];
    sort(b+1,b+1+n);
    int sz = unique(b+1,b+1+n) - b-1;
    for(int i = 1;i<=n;++i)
    {
        int t = lower_bound(b+1,b+1+sz,arr[i]) - b;
        mp[t] = arr[i];
        arr[i] = t;
    }
    build(1,1,n);
    for(int i = 1;i<=m;++i) update(1,1,n,arr[i],1);
    for(int i = m+1;i<=n+1;++i)
    {
        int ck = query(1,1,n);
        if(ck==-1) printf("Nothing\n");
        else printf("%d\n",mp[ck]);
        if(i==n+1) break;
        update(1,1,n,arr[i-m],-1);
        update(1,1,n,arr[i],1);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}