数据结构
文章平均质量分 82
utoppia
这个作者很懒,什么都没留下…
展开
-
sgu 133 Border
题目描述:133. Bordertime limit per test: 0.5 sec. memory limit per test: 4096 KBAlong the border betweenstates A and B there are N defence outposts. For everyoutpostk, the interval [Ak原创 2012-11-01 20:34:48 · 382 阅读 · 0 评论 -
Ural 1613. For Fans of Statistics
PRO IS HEREMap + lower_bound轻松解决;CODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a)原创 2013-05-30 15:32:58 · 623 阅读 · 0 评论 -
Ural 1671. Anansi's Cobweb
PRO IS HEREUnion_Find set:并查集。注意我们从后往前加边,离线算法。如果有某条边删除两次以上,只保留较早的那个删除操作,实现时用vis判断。CODE:#include#include#include#include#include#include#include#include#include#includeus原创 2013-05-30 15:50:45 · 720 阅读 · 0 评论 -
Ural 1494. Monobilliards
PRO IS HEREA Easy Problem about Stack;CODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=原创 2013-06-04 15:22:56 · 1104 阅读 · 0 评论 -
Ural 1471. Tree
PRO IS HERE离线最近公共祖先;LCA;d[u,v] = d[root,u]+d[root,v] - 2*d[root,ancestor(u,v)];CODE:#include#include#include#include#include#include#include#include#include#includeusin原创 2013-06-04 16:22:34 · 595 阅读 · 0 评论 -
Ural 1521. War Games 2
PRO IS HERE简单的数状数组 + 二分搜索。CODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b)原创 2013-06-05 22:32:49 · 1033 阅读 · 0 评论 -
HDU 1540
Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3240 Accepted Submission(s): 1252Problem DescriptionDuring the原创 2013-08-25 00:51:00 · 1065 阅读 · 0 评论 -
HDU 1394
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7907 Accepted Submission(s): 4851Problem DescriptionT原创 2013-08-25 00:20:04 · 576 阅读 · 0 评论 -
HDU 1022 Train Problem I
栈模拟#include #include #include #include #include using namespace std;#define sf scanf#define pf printf#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)#define dbg(x) cerr << "Line:" << __LI原创 2013-11-10 14:24:07 · 643 阅读 · 0 评论 -
模板,线段树,矩形轮廓周长
原理和面积并是一样的,注意有了两边的长要计算;原创 2014-04-16 11:17:01 · 569 阅读 · 0 评论 -
Ural 1306. Sequence Median
PRO IS HERE优先队列;维护一个大小为N/2的最大堆。实现的话用STL 的 priority_queueCODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#defi原创 2013-05-30 15:07:27 · 677 阅读 · 0 评论 -
Ural 1654 Cipher Message
PRO IS HERE简单的StackCODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)原创 2013-05-30 14:10:14 · 779 阅读 · 1 评论 -
Ural 1100
PRO IS HERE简单的桶排序。CODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#def原创 2013-05-30 13:59:22 · 685 阅读 · 0 评论 -
sgu 155 Cartesian Tree
155. Cartesian Treetime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standard inputoutput: standard outputLet us consider a special type of binary search trees, ca原创 2012-11-05 21:07:23 · 383 阅读 · 0 评论 -
sgu 174 Walls
174. Wallstime limit per test: 1.5 sec.memory limit per test: 32768 KBinput: standardoutput: standardPeople of country T-land lived on the big plain many years ago. It is happened原创 2012-11-07 19:53:19 · 626 阅读 · 0 评论 -
sgu 193 Chinese Girls' Amusement
193. Chinese Girls' Amusementtime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standardoutput: standardYou must have heard that the Chinese culture is quite differ原创 2012-11-06 23:18:13 · 8971 阅读 · 0 评论 -
NEERC 2004 Western Sub(spoj417 or poj 2970)
PRO IS HERE就是校赛的题目啊,有木有。。#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#define nMax 101000原创 2013-04-18 22:25:20 · 852 阅读 · 0 评论 -
NEERC 2005 Feel Good (Poj2976)
PRO IS HEREa[i] 最小的区间是固定的,可以用一个栈啊什么的求出左右比之小的第一个数的位置,而后就是模拟,但是我的代码过不了LA上HERE不知到时为什么。‘代码:#include#include#include#include#include#include#includeusing namespace std;#define原创 2013-04-19 21:46:13 · 1038 阅读 · 0 评论 -
SGU_271_Book_Pile
PRO IS HERE双端队列模拟过程即可,很像2013华中网络预赛的某题。。。好像是D#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)原创 2013-04-19 21:08:02 · 604 阅读 · 0 评论 -
Ural 1003 Parity
PRO IS HERE大意:一段长度为n的路,已知m对信息,信息告诉你某两点之间的距离的奇偶,问你到哪个信息是错的。解答:明显的并查集,保存距离的奇偶,find的时候顺便跟新一下。。。我就是忘记了fa[x] = k查了n久的代码啊,弱菜就是弱啊。。。#include#include#include#include#include#i原创 2013-04-21 23:24:15 · 682 阅读 · 0 评论 -
Ural 1126. Magnetic Storms
PRO IS HERE单调队列;维护区间长最大m的一个单调递减队列。CODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a原创 2013-05-30 14:44:59 · 682 阅读 · 0 评论 -
Ural 1028. Stars
PRO IS HERE数状数组解决:小的trick:将x的值+1CODE:#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i原创 2013-05-30 17:00:32 · 823 阅读 · 0 评论 -
模板,树状数组
树状数组的神奇在于省空间和时间;空间复杂度O(原创 2014-04-16 21:12:18 · 533 阅读 · 0 评论