
poj
文章平均质量分 68
Aki_Mutou
Qingdao->Jinan->Tokyo->Osaka
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ2386 Lake Counting(dfs求连通块/%c与%s)
那一天我十九岁,在我一生的黄金时代,我有好多奢望。我想爱,想吃,还想在一瞬间变成天上半明半暗的云,后来我才知道,生活就是个缓慢受锤的过程,人一天天老下去,奢望也一天天消逝,最后变得像挨了锤的牛一样。可是我过二十一岁生日时没有预见到这一点。我觉得自己会永远生猛下去,什么也锤不了我。(什么时候结课啊,我要卒了) Time Limit: 1000MS Memory Limit: 65536K Tota...原创 2019-01-21 20:13:01 · 171 阅读 · 0 评论 -
POJ3061 Subsequence(尺取)
我是一个没有感情的打投女工,眼里没有idol,只有票。 Description A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Writ...原创 2019-05-24 19:08:54 · 248 阅读 · 0 评论 -
POJ3723 Conscription(最小生成树/Kruskal)
Description Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without an...原创 2019-04-03 22:15:25 · 233 阅读 · 0 评论 -
POJ3255 Roadblocks(次短路)
点我看题 Description Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery a...原创 2019-04-03 22:11:44 · 167 阅读 · 0 评论 -
POJ3253 Fence Repair(贪心+二叉树)
等看到那儿再填了这个坑。。 点我看题原创 2019-02-26 21:34:56 · 185 阅读 · 0 评论 -
POJ2431 Expedition(优先队列)
我永远喜欢韦伯·维尔维特.jpg原创 2019-03-08 20:24:54 · 184 阅读 · 0 评论 -
POJ3069 Saruman's Army
我离被自己气死就差那么一点 Description 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, a...原创 2019-02-26 20:21:21 · 170 阅读 · 0 评论 -
POJ1979 Red and Black(dfs求连通块(的个数))
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’...原创 2019-02-24 21:44:51 · 152 阅读 · 0 评论 -
POJ3617 Best Cow Line(贪心:字典序最小+正确的输入/输出姿势)
这个题我好像在哪儿见过…… Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 36220 Description FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest...原创 2019-02-21 22:43:56 · 191 阅读 · 0 评论 -
POJ2456(二分/最大化最小值)
声乐考核没叔,原创 2019-05-22 20:02:59 · 326 阅读 · 0 评论