Tunnel Warfare 无脑模拟
来源:互联网 发布:淘宝助理导出订单吗 编辑:程序博客网 时间:2024/05/03 01:11
During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Except the two at the ends, every village was directly connected with two neighboring ones.Frequently the invaders launched attack on some of the villages and destroyed the parts of tunnels in them. The Eighth Route Army commanders requested the latest connection state of the tunnels and villages. If some villages are severely isolated, restoration of connection must be done immediately!
Input
The first line of the input contains two positive integers n and m
(n, m ≤ 50,000) indicating the number of villages and events. Each
of the next m lines describes an event.There are three different events described in different format shown below:
D x: The x-th village was destroyed.
Q x: The Army commands requested the number of villages that x-th village was directly or indirectly connected with including itself.
R: The village destroyed last was rebuilt.
Output
Output the answer to each of the Army commanders’ request in order on a separate line.
Sample Input7 9
D 3
D 6
D 5
Q 4
Q 5
R
Q 4
R
Q 4
Sample Output
1024
题意: 给你n个桩,m个操作
接下来m行 每行两个数据a b
a=Q时为查询包含b的最大连续子串;
这题是在学长给的线段树练习题中看到的。 看了很久都不会用线段树写,果断无脑暴力模拟一波。
#include <iostream>#include <set>#include <functional>#include<algorithm>#include<cstdio>#include<stack>using namespace std;set<int > S;int main(){ int n,m; while(cin>>n>>m) { int per; S.clear(); S.insert(0); S.insert(n+1); stack<int> ST; for(int i=0;i<m;i++) { int cao; char dos; cin>>dos; if(dos=='D') { scanf("%d",&cao); ST.push(cao); S.insert(cao); } else if(dos=='Q') { cin>>cao; if(S.find(cao)!=S.end()) puts("0"); else { set<int>::iterator it1=S.upper_bound(cao); set<int>::iterator it2=(S.lower_bound(cao)); it2--; //cout<<"it1 : it2 "<<*it1<<" "<<*it2<<endl; cout<<(*it1-*it2-1)<<endl; } } else{ S.erase(ST.top()); ST.pop(); } } }}
- Tunnel Warfare 无脑模拟
- Tunnel Warfare
- Tunnel Warfare
- Tunnel Warfare
- Tunnel Warfare
- Tunnel Warfare
- poj hdu Tunnel Warfare
- poj 2892 Tunnel Warfare
- poj 2892 Tunnel Warfare
- hdu 1540 Tunnel Warfare
- hdu 1540 Tunnel Warfare
- poj 2892 Tunnel Warfare
- hdu 1540 Tunnel Warfare
- POJ2892 Tunnel Warfare
- hdu 1540 Tunnel Warfare
- poj 2892 Tunnel Warfare
- HDU 1540 Tunnel Warfare
- POJ 2892 Tunnel Warfare
- 二进制的一些
- 使用简单的fragment实现左侧导航
- vim基础入门
- Android中AES加密和解密
- 理解垃圾回收算法
- Tunnel Warfare 无脑模拟
- 某些自己易犯的错误
- mysql数据库连接篇
- 利用cython将python转为c代码
- sdut_java_水杯
- 五、Java对象的访问定位
- 使用ServerSocket建立聊天服务器(一)
- java基础十一 面向对象特点_封装
- ubuntu安装budgie桌面