
poj
Viscu
勤能补拙。
展开
-
POJ1061 青蛙的约会(扩展欧几里得)
青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 108204 Accepted: 21663 Description 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,原创 2016-09-22 19:51:08 · 1087 阅读 · 0 评论 -
poj3061 Subsequence(尺取法)
Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14033 Accepted: 5936 DescriptionA sequence of N positive integers (10 < N < 100 000), each of them less than or equal原创 2017-04-06 16:58:55 · 355 阅读 · 0 评论 -
POJ1041 John's trip(欧拉回路+打印路径)
John's trip Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8960 Accepted: 3002 Special Judge DescriptionLittle Johnny has got a new car. He decided to drive around the town to原创 2017-03-24 19:13:06 · 425 阅读 · 0 评论 -
poj 1308 Is It A Tree?(并查集)
Is It A Tree? Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 31698 Accepted: 10765 DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or原创 2017-03-23 14:01:12 · 344 阅读 · 0 评论 -
POJ1273 Drainage Ditches(dinic)
DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow原创 2017-02-27 23:15:08 · 747 阅读 · 0 评论 -
POJ2195 Going Home(spfa费用流+链式前向星)
Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22091 Accepted: 11156 DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man原创 2016-12-05 16:45:19 · 416 阅读 · 0 评论 -
POJ1056 IMMEDIATE DECODABILITY(Trie树)
IMMEDIATE DECODABILITY Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 13123 Accepted: 6275 DescriptionAn encoding of a set of symbols is said to be immediately decodable if no c原创 2016-11-01 22:49:17 · 340 阅读 · 0 评论 -
POJ 2785 4 Values whose Sum is 0(二分法)
4 Values whose Sum is 0 Time Limit: 15000MS Memory Limit: 228000K Total Submissions: 20385 Accepted: 6116 Case Time Limit: 5000MS Description The SUM problem can be formulated as follows: gi原创 2016-11-01 19:48:08 · 328 阅读 · 0 评论 -
POJ2991 Crane(线段树成段更新+向量旋转)
DescriptionACM has bought a new crane (crane -- jeřáb) . The crane consists of n segments of various lengths, connected by flexible joints. The end of the i-th segment is joined to the beginning of the原创 2016-10-15 21:21:45 · 431 阅读 · 0 评论 -
POJ3320 Jessica's Reading Problem(尺取法)
Jessica's Reading Problem Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11032 Accepted: 3718 DescriptionJessica's a very lovely girl wooed by lots of boys. Recently she has a p原创 2016-11-06 22:17:31 · 307 阅读 · 0 评论 -
POJ1006 Biorhythms(中国剩余定理)
Biorhythms Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 130935 Accepted: 41750 DescriptionSome people believe that there are three cycles in a person's life that start the day原创 2016-10-12 00:40:24 · 424 阅读 · 0 评论 -
POJ 3225 区间 线段树
LogLoader是一家专门提供日志分析产品的公司。Ikki在做毕业设计的同时,还忙于在LogLoader做实习。在他的工作里,有一项是要写一个模块来处理时间区间。这个事情一直让他感到很迷糊,所以现在他很需要你帮忙。 在离散数学里面,你已经学习了几种基本的集合运算,具体地说就是并、交、相对补和对称差。它们自然地也适用于区间这种特殊的集合。作为你的快速参考,它们可以总结成下表: 运...原创 2018-09-16 21:51:05 · 302 阅读 · 0 评论