- 博客(5)
- 资源 (23)
- 收藏
- 关注
原创 Hilary动态规划DP
HilaryTime Limit:1000MS Memory Limit:65536KTotal Submit:38 Accepted:4 Description Dearway is fond of sleeping, but he always feels it is not enough even though 8 hours. Therefore he usually nap
2010-04-27 19:11:00 611
原创 Interesting Problem容斥原理
Interesting ProblemDescription Dearway knows some people like math problems but other not. Now the fact is in front of you all. Give n integers x1 x2 ... xn, you should count how many integers f
2010-04-27 19:00:00 810
转载 DP最大M子段和
给定n个数求这n个数划分成互不相交的m段的最大m子段和。 经典的动态规划优化的问题。设f(i, j)表示前i个数划分成j段,且包括第i个数的最大m子段和,那么有dp方程: f(i, j) = max { f(i - 1, j) + v[i], max {f(k, j - 1) + v[i]}(k = j - 1 ... i - 1) } 也就是说第i个数要么自己划到第j段,要么和前一个数
2010-04-11 16:12:00 2083 1
原创 UESTC1193 Love is Persistence
Love is Persistence Time Limit:1000ms Memory Limit: 65536K Submited:240 Accepted:46 Cached at 2010/4/10 12:16:40 DescriptionMengqian has attracted overwhelming boys after March 1
2010-04-10 12:18:00 813
原创 hdu3371 Connect the Cities
Connect the CitiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 868 Accepted Submission(s): 308Problem DescriptionIn 2100, since the
2010-04-10 12:15:00 715
acquia-drupal-win-7.14.14开发环境
2012-09-12
acquia-drupal
2012-09-12
GDB官方文档
2012-09-12
搜索入门之BFS深度优先搜索.ppt
2010-04-18
英语写作经典句子200.doc
2010-04-18
CET-6作文应试技巧.rtf
2010-04-18
ACM实用函数选.doc
2010-04-18
ACM算法模板选doc
2010-04-18
wdl文件格式阅读器下载
2009-03-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人