poj
ERROR无限
这个作者很懒,什么都没留下…
展开
-
poj 2386 lake counting
Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water (原创 2016-04-03 16:41:27 · 261 阅读 · 1 评论 -
poj 3617 best cow line
http://poj.org/problem?id=3617#include using namespace std;const int maxn = 2000;char s[maxn + 1];char k[maxn + 1];int main(){ int n; cin >> n; for(int i=0; i<n; i++)原创 2016-04-10 20:45:28 · 301 阅读 · 0 评论 -
poj 1611
DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best s原创 2016-05-17 15:23:58 · 239 阅读 · 0 评论 -
poj 2559
#include #include using namespace std;const int N = 100005;struct Elem{ int height; int count;};Elem stack[N];int top;int main(){ int height, n; long long ans, tot, tmp; while (scan原创 2016-05-30 21:07:20 · 320 阅读 · 0 评论 -
poj 2796 单调栈
Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people's memories about some period of life. A ne原创 2016-05-29 16:14:36 · 242 阅读 · 0 评论 -
poj 2063
John never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only in原创 2016-07-25 12:00:28 · 223 阅读 · 0 评论 -
poj 1661
Language:DefaultHelp JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10331 Accepted: 3383Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括原创 2016-07-26 20:03:09 · 204 阅读 · 0 评论 -
poj 2104 K-th number
DescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able原创 2016-09-11 12:35:58 · 273 阅读 · 0 评论 -
poj 3468
DescriptionYou have N integers, A1,A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other原创 2016-10-08 20:17:02 · 201 阅读 · 0 评论 -
一些线段树的题目
hdu 1689lazt tag#include#includeusing namespace std;const int maxn = 800000;const int inf = 65535;int add[maxn];struct node{ int l, r, sum;}tree[maxn];void build(int rt, int l, int r)原创 2016-10-13 21:23:06 · 215 阅读 · 0 评论 -
poj 2195 最小费用最大流
///题意:n个人和m个房子,每个房子中要安排一个人,每个人移动一步费用为1, ///所有人安排房子后需要的金钱的最小值。///曼哈顿距离:例如在平面上,坐标(x1, y1)的i点与坐标(x2, y2)的j点的曼哈顿距离为: /// d(i,j)=|X1-X2|+|Y1-Y2|.///建图:网络流,建一个超源 0,超汇 E /// 1> 超源 0 到 所有人建原创 2016-10-14 20:39:06 · 204 阅读 · 0 评论 -
poj 3069 Saruman's army
Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the troops. Each pala原创 2016-04-11 20:24:22 · 174 阅读 · 0 评论 -
poj 3050 hopscotch
果然啊 遇到DFS就不会 要多加练习啊The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digi原创 2016-04-08 21:01:34 · 302 阅读 · 1 评论 -
poj 1979 Red and Black
Red and Blackhttp://poj.org/problem?id=1979Time Limit: 1000MSMemory Limit: 30000KDescriptionThere is a rectangular room, covered with square tiles. Each tile is col原创 2016-03-30 19:31:58 · 244 阅读 · 0 评论 -
poj 3009 新方法
///模拟所有情况#includeusing namespace std;const int inf=11;typedef class{ public: int r,c; //冰壶当前位置 bool status; //status冰壶当前状态:运动true ,静止false}SE;SE s,e; //记录冰壶起止点int w转载 2016-04-02 16:37:00 · 237 阅读 · 0 评论 -
poj 3009 curling
刚开始的时候走错了路 试图用BFS解题 浪费了不少时间///本题虽然是要找 “最短路”,但是BFS几乎不可能,因为每“走一步”,场地的状态就要///改变一次;而如果该步不满足要求,又要求把场地的状态还原到前一步,这只有DFS///能做到。///步数超过10则视为失败”的条件,这是用来剪枝的On Planet MM-21, after their Olympic game原创 2016-04-02 16:17:47 · 197 阅读 · 0 评论 -
poj2251的代码又改了改~
#includeusing namespace std;#include#include#includechar temp;bool vis[50][50][50];bool vist[50][50][50];const int dx[6] = {1,-1,0,0,0,0};const int dy[6] = {0,0,1,-1,0,0};const int dz[6] =原创 2016-04-01 20:35:56 · 421 阅读 · 0 评论 -
poj 1083
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south side along the原创 2016-03-10 13:52:25 · 228 阅读 · 0 评论 -
poj 2251 Dungeon Master(BFS)
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24330 Accepted: 9437DescriptionYou are trapped in a 3D dungeon and need to find the quic原创 2016-03-30 14:41:35 · 206 阅读 · 0 评论 -
poj 2739
Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two repre原创 2016-03-09 20:32:11 · 343 阅读 · 0 评论 -
poj2159 对我来说不是水题的水题
要不是看了题解,怎么都想不到只要两字符串中字母频数相同,就yes。就傻傻的一直按第二段第三段方法做变换,T^TAncient Roman empire had a strong government system with various departments, including a secret service department. Important documents原创 2016-03-09 20:38:42 · 1420 阅读 · 0 评论 -
poj 1852 ants
果然数组开小就会runtime errorAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it.原创 2016-04-04 17:43:26 · 184 阅读 · 0 评论 -
poj 3278 catch the cow
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,0原创 2016-04-05 23:25:35 · 345 阅读 · 0 评论 -
poj 3669 meteor shower
Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they hit. Anxious for her safety, she vows to find her way to a sa原创 2016-04-07 18:07:45 · 321 阅读 · 0 评论 -
poj3320 hash
///这道题目可以用哈希表法也可以用二分查找法,现在用哈希,二分查找将在后面的博客中推出。///这道题目用到的是数的哈希,对于不需要删除的字典,哈希表是一种理想的实现方式。///1.哈希表的插入和查找算法///(1)计算函数值h(k)///(2)从槽h(k)开始,使用冲突解决策略定位包含关键码k的纪录///(3)如果需要插入,再槽内插入即可///两种操作的复杂度在忽略冲突时是O(1)原创 2016-10-15 18:28:30 · 284 阅读 · 0 评论