uestc data structure D - 秋实大哥与战争
2015-04-21 16:34
190 查看
本来我是基本不会stl的,但这题还是让我体会到了stl的有用,看来要把stl加入我的学习计划了
#include<cstdio> #include<iostream> #include<cstring> #include<set> #include<algorithm> #define MAX 100010 using namespace std; int main(){ int n,m,t,x; cin>>n>>m; set<int>s; s.insert(0); s.insert(n+1); for(int i=0;i<m;i++){ cin>>t>>x; if(t==0){ s.insert(x); } else if(t==1){ s.erase(x); } else if(t==2){ if(s.count(x)){ cout<<0<<endl; continue; } set<int>::const_iterator it=s.lower_bound(x),it2=it; it2--; cout<<*it-*it2-1<<endl; } } return 0; }
相关文章推荐
- uestc data structure training f 秋实大哥与妹纸
- uestc data structure n 秋实大哥搞算数
- uestc data structure n 秋实大哥与快餐店
- UESTC_秋实大哥与战争 2015 UESTC Training for Data Structures<Problem D>
- UESTC_秋实大哥与家 2015 UESTC Training for Data Structures<Problem E>
- UESTC_秋实大哥与妹纸 2015 UESTC Training for Data Structures<Problem F>
- UESTC_秋实大哥去打工 2015 UESTC Training for Data Structures<Problem G>
- 2016 UESTC Training for Data Structures N - 秋实大哥搞算数 用栈处理表达式
- UESTC_秋实大哥打游戏 2015 UESTC Training for Data Structures<Problem H>
- UESTC_秋实大哥下棋 2015 UESTC Training for Data Structures<Problem I>
- UESTC -- 1061 秋实大哥与战争(暴力/set)
- UESTC_秋实大哥与线段树 2015 UESTC Training for Data Structures<Problem M>
- 2015 UESTC Training for Data Structures 秋实大哥下棋
- 2016 UESTC Training for Data Structures N - 秋实大哥搞算数 CDOJ 1074 栈 表达式求值
- UESTC 1061 秋实大哥与战争 线段树区间合并
- UESTC_秋实大哥搞算数 2015 UESTC Training for Data Structures<Problem N>
- 2015 UESTC 数据结构专题D题 秋实大哥与战争 变化版本的线段树,合并区间,单点查询
- 2015 UESTC 数据结构专题D题 秋实大哥与战争 SET的妙用
- UESTC_秋实大哥与小朋友 2015 UESTC Training for Data Structures<Problem A>
- [UESTC 1061]秋实大哥与战争