就是维护一个有序的序列,对这个序列进行插入,删除,加和,查找第k大的数值,但值得注意的是,在插入的时候,如果他的工资起始就比工资下届底就不需要插入了,这表示他每到公司,也不算离开。删除的时候也要判断下,ss是否是起始的节点,如果是的话同样也不需要删除的操作
/*************************************************************************
> File Name: NOI2004.cpp
> Author: Ac_Toy
> Mail: ycsgldy@163.com
> Created Time: 2013年06月21日 星期五 06时48分17秒
************************************************************************/
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef unsigned int u32;
typedef long long i64;
typedef unsigned long long u64;
typedef vector<int> IV;
typedef vector<bool> BV;
typedef pair<int,int> II;
typedef vector<II> IIV;
#define For(t,v,c) for(t::const_iterator v=c.begin(); v!=c.end(); ++v)
const int INF = 0x7FFFFFFF;
const double eps = 1E-10;
const double PI = acos(-1);
struct Node *null;
int cnt;//序列元素个数
int leave;
struct Node {
Node *ch[2];
int s;//结点总数
i64 v;
i64 lazy;
int cmp(int k) const {
int d = k - ch[0]->s;
if ( d == 1 ) return -1;
return d <= 0 ? 0 : 1;
}
void maintain() {
s = ch[0]->s + ch[1]->s + 1;
}
void pushdown() {
if(lazy) {
ch[0]->v += lazy;
ch[0]->lazy += lazy;
ch[1]->v += lazy;
ch[1]->lazy += lazy;
}
lazy = 0;
}
};
Node *start_node;
void rotate(Node* &o, int d) {//旋转
Node* k = o->ch[d^1]; o->ch[d^1] = k->ch[d]; k->ch[d] = o;
o->maintain(); k->maintain(); o = k;
}
void splay(Node* &o, int k) {//找到序列的左数第k个元素并伸展到根
o->pushdown();
int d = o->cmp(k);
if(d == 1) k -= o->ch[0]->s + 1;
if(d != -1) {
Node* p = o->ch[d];
p->pushdown();
int d2 = p->cmp(k);
int k2 = (d2 == 0 ? k : k - p->ch[0]->s - 1);
if(d2 != -1) {
splay(p->ch[d2], k2);
if(d == d2) rotate(o, d^1); else rotate(o->ch[d], d);
}
rotate(o, d^1);
}
}
// 合并left和right。假定left的所有元素比right小。注意right可以是null,但left不可以
Node* merge(Node* left, Node* right) {
splay(left, left->s);
left->ch[1] = right;
left->maintain();
return left;
}
// 把o的前k小结点放在left里,其他的放在right里。1<=k<=o->s。当k=o->s时,right=null
void split(Node* o, int k, Node* &left, Node* &right) {
splay(o, k);
left = o;
right = o->ch[1];
o->ch[1] = null;
left->maintain();
}
const int maxn = 100000 + 10;
int A[maxn];
struct SplaySequence {
int n;
Node seq[maxn];
Node *root;
Node* build(int sz) {
if(!sz) return null;
Node* L = build(sz/2);
Node* o = &seq[++n];
o->v = A[n-1];//结点编号;A[0]是虚拟结点
o->ch[0] = L;
o->ch[1] = build(sz - sz/2 - 1);
o->s = o->lazy = 0;
o->maintain();
return o;
}
void init(int sz) {
n = 0;
null = new Node();
null->s = null->v = null->lazy = 0;
root = build(sz);
}
};
vector<int> ans;
void print(Node* o) {
if(o != null) {
o->pushdown();
print(o->ch[0]);
ans.push_back(o->v);
print(o->ch[1]);
}
}
void debug(Node* o) {
if(o != null) {
o->pushdown();
debug(o->ch[0]);
printf ( "%d ", o->v );
//printf ( " v=%d,s=%d,flip=%d,lazy=%d,mi=%d", o->v,o->s,o->flip,o->lazy2,o->mi);
//printf ( "%d, left=%d,s=%d,mi=%d,*right=%d,s=%d,mi=%d\n", o->v, o->ch[0]->v,o->ch[0]->s,o->ch[0]->mi, o->ch[1]->v,o->ch[1]->s,o->ch[1]->mi );
debug(o->ch[1]);
}
}
SplaySequence ss;
void add(int x) {//从小到大插入x, 虚拟结点的v=-INF;
cnt++;
Node *p = ss.root;
int k = 0;
while ( p != null ) {
p->pushdown();
if(p->v > x) p = p->ch[0];
else {
k += p->ch[0]->s + 1;
p = p->ch[1];
}
}
Node *left, *right;
split(ss.root, k, left, right);
Node *mid = new Node();
mid->ch[0] = mid->ch[1] = null;
mid->s = 1;//很关键
mid->v = x; mid->lazy = 0;
ss.root = merge(merge(left, mid), right);
}
void del(int x) {
int k = 0;//k表示所有比x小的数的个数
Node *p = ss.root;
while ( p != null ) {
p->pushdown();
if(p == start_node ) {
p = p->ch[1];
k += 1;
continue;
}
if(p->v >= x) p = p->ch[0];
else {
k += p->ch[0]->s + 1;
p = p->ch[1];
}
}
if(k == 1) return;
Node *left, *mid, *right, *o;
split(ss.root, 1, left, o);
split(o, k - 1, mid, right);
ss.root = merge(left, right);
cnt -= k - 1;
leave += k - 1;
}
void updata(int c) {
Node *left, *right;
split(ss.root, 1, left, right);
right->v += c;
right->lazy += c;
ss.root = merge(left, right);
}
int query(int k) {//询问第k大的数, cnt为序列元素个数
if(cnt-1 < k) return -1;
Node *left, *mid, *right, *o;
k = cnt-k+1; //printf ( "k=%d\n", k );
split(ss.root, k, left, right); //printf("left:");debug(left);puts("");
ss.root = merge(left, right);
return left->v;
}
int main()
{
int Case, num, k;
char c;
leave = 0;
A[0] = -INF;
ss.init(1);
start_node = ss.root;
cnt++;
scanf("%d%d", &Case, &num);
getchar();
while(Case--) {
scanf("%c%d", &c, &k);
getchar();
if(c == 'I') {
if(k < num) continue;
add(k);
}
else if(c == 'A') {
updata(k);
}
else if(c == 'S') {
updata(-k);
}
else if(c == 'F') {
printf("%d\n", query(k));
}
del(num);
}
printf("%d\n", leave);
return 0;
}