poj
文章平均质量分 69
jerans
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ -2236 Wireless Network
帅气的HYC很无奈 发布时间: 2015年11月1日 17:02 最后更新: 2015年11月1日 18:41 时间限制: 1000ms 内存限制: 128M 描述 An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wi原创 2016-11-03 13:17:43 · 247 阅读 · 0 评论 -
poj 1182 食物链 //带权并查集
食物链 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu Submit Status Practice POJ 1182 Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,原创 2016-11-15 21:12:57 · 361 阅读 · 0 评论 -
POJ 1703 Find them, Catch them
Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 42639 Accepted: 13120 Description The police office in Tadu City decides to say end原创 2016-11-23 19:47:15 · 320 阅读 · 0 评论 -
poj1426 Find The Multiple
Find The Multiple Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 29065 Accepted: 12059 Special Judge Description Given a positive integer n, write a原创 2017-01-29 20:28:19 · 275 阅读 · 0 评论 -
poj 3279 Fliptile
Fliptile Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 8690 Accepted: 3255 Description Farmer John knows that an intellectually satisfied cow is a happ原创 2017-01-29 20:37:30 · 265 阅读 · 0 评论 -
POJ 3026 Borg Maze //qdu_cxsys_最小生成树
Borg Maze Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description The Borg is an immensely powerful race of enhanced humanoids from the d原创 2016-11-15 19:24:59 · 333 阅读 · 0 评论 -
poj 3723 Conscription // qdu - F
F - Conscription Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description Windy has a country, and he wants to build an army to protect原创 2016-11-07 21:05:23 · 314 阅读 · 0 评论 -
poj2019 Cornfields
B - Cornfields Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %llu Submit Status Practice POJ 2019 Description 给出一个N*N (N 注意对于所有的询问,B都是一个定值。 Input原创 2017-03-10 15:06:16 · 380 阅读 · 0 评论 -
POJ - 2182 D - Lost Cows 暴力//树状数组加二分
Lost Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11614 Accepted: 7465 Description N (2 <= N <= 8,000) cows have unique brands in the range 1..N.原创 2017-03-15 12:55:33 · 387 阅读 · 0 评论 -
POJ - 1837 Balance 记忆化搜索,背包
Balance Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 13998 Accepted: 8799 Description Gigel has a strange "balance" and he wants to poise it. Actually原创 2017-02-05 23:12:49 · 527 阅读 · 0 评论 -
A - A Simple Problem with Integers POJ - 3468 线段树
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 109423 Accepted: 34074 Case Time Limit: 2000MS Description You have原创 2017-05-25 21:28:15 · 233 阅读 · 0 评论 -
POJ - 3666 Making the Grade 二维dp
Making the Grade Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7096 Accepted: 3282 Description A straight dirt road connects two fields on FJ's farm, b原创 2017-04-26 17:19:30 · 354 阅读 · 0 评论 -
H - Protecting the Flowers POJ - 3262 贪心
http://poj.org/problem?id=3262 题意:n头牛在吃草,每秒吃di,你要驱赶这些牛,驱赶的时间2*ti,求怎么赶走全部牛,使总共吃最少的草(牛从你开始赶它就不在吃草 看了题解才会。。。。。 设已经x时刻 两头牛,判断是否要交换赶牛的顺序 di,ti dj,tj 先第i头在第j头 吃的草:x*di+(x+2*ti)*dj 先第j头在第i头 吃的草:x原创 2017-07-20 23:18:42 · 353 阅读 · 0 评论
分享