Vmorish

—— Anything is possible

CodeForces - 191A Dynasty Puzzles(dp)

The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But...

2017-10-09 09:59:32

阅读数:172

评论数:0

HDU - 4128 Running relay(贪心+凸包+三分)

HDU - 4128 Running relay(贪心+凸包+三分) Problem Description The school track-and-field team is taking a running relay race. There are n (2<=n<=104)...

2017-08-31 19:30:55

阅读数:212

评论数:0

Balala Power(贪心)

hduoj好像挂了,就不给链接了哇... 题意:给n个字符串,然后每个字母可以转化为其他的25个小写字母,字母a-z依次表示0-25,其中不同的两字母不能转化为相同的字母,让求转化后的字符串的总和最大. 分析:根据每个字母对应所在位置的权值贪心...(看了标程才完全理清思路) 参考代码: #inc...

2017-07-26 10:48:05

阅读数:233

评论数:0

贪心基础题(区间调度问题+POJ_3617+POJ_3069)

贪心法就是遵循某种规则,不断贪心地选取当前最优策略的算法设计方法.(贪心法和动态规划的区别) 1.区间调度问题 Q:一共有n项工作,每项工作的起始时间分别为s[i],e[i],你可以自主选择是否参加每项工作,现在希望能够参加最多的工作(每项工作决定了参加就必须全程参与),先想知道最多能参加多少...

2017-05-20 14:52:15

阅读数:395

评论数:0

Y2K Accounting Bug

Description Accounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS In...

2017-03-12 14:29:15

阅读数:197

评论数:0

poj_1089Intervals

Description There is given the series of n closed intervals [ai; bi], where i=1,2,...,n. The sum of those intervals may be represented as a sum of...

2017-03-11 22:52:02

阅读数:110

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭