# CF69 E. Subsegments

$$B_1,...,B_{n-k+1}$$的值

$$C_x=1$$的数随便用个数据结构维护就行，这里我选用的是set

/*program from Wolfycz*/
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define Fi first
#define Se second
#define ll_inf 1e18
#define MK make_pair
#define sqr(x) ((x)*(x))
#define pii pair<int,int>
#define int_inf 0x7f7f7f7f
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
inline char gc(){
static char buf[1000000],*p1=buf,*p2=buf;
}
template<typename T>inline T frd(T x){
int f=1; char ch=gc();
for (;ch<'0'||ch>'9';ch=gc())	if (ch=='-')    f=-1;
for (;ch>='0'&&ch<='9';ch=gc())	x=(x<<1)+(x<<3)+ch-'0';
return x*f;
}
int f=1; char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar())	if (ch=='-')	f=-1;
for (;ch>='0'&&ch<='9';ch=getchar())	x=(x<<1)+(x<<3)+ch-'0';
return x*f;
}
inline void print(int x){
if (x<0)	putchar('-'),x=-x;
if (x>9)	print(x/10);
putchar(x%10+'0');
}
const int N=1e5;
int A[N+10],list[N+10];
set<int>ST;
int Cnt[N+10];
if (!x)	return;
if (Cnt[x]==1)	ST.erase(x);
Cnt[x]+=v;
if (Cnt[x]==1)	ST.insert(x);
}
void Ans(){
if (ST.empty()){
printf("Nothing\n");
return;
}
printf("%d\n",list[*ST.rbegin()]);
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);