poj
文章平均质量分 84
xiaohuihuicb
分享快乐
展开
-
POJ-2342::Anniversary party-树形DP
Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor rela原创 2015-07-30 15:40:06 · 469 阅读 · 0 评论 -
POJ3258—River Hopscotch—二分法求the largest mimmun
Description Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straigh原创 2015-07-31 21:24:28 · 909 阅读 · 0 评论 -
POJ2456—Aggressive cows—二分法求 the largest minimum
Description Farmer John has built a new long barn, with N (2 His C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To preven原创 2015-07-31 20:10:00 · 548 阅读 · 0 评论 -
POJ 1787 Charlie's Change 记录路径的多重背包
Charlie's Change Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3499 Accepted: 1032 Description Charlie is a driver of Advanced Cargo Movement, Ltd. Charl原创 2015-07-28 19:54:54 · 590 阅读 · 0 评论 -
poj 3468 树状数组 区间更新 区间求和
poj 3468 /* 树状数组区间更新,区间求和 利用两个树状数组进行实现 原理 先讲:通过树状数组的区间更新,单点查询我们知道 对一个点i的更新值为sum(c[1...i])+a[i] a[]为初始数据,c[]为树状数组的值 那么对于区间[l,r] 则为:SUM = sum[a[l...r]]+sum[sum(c[1...l])...sum(c[1...r])]原创 2016-07-29 23:59:25 · 560 阅读 · 0 评论