关闭

HDU 5115 Dire Wolf (区间DP)

Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 2761 Accepted Submission(s): 1632 Problem Description Dire wolves, also known as Dark wolves, are extraordinarily large and powerful...
阅读(266) 评论(0)

BZOJ 1072 [SCOI2007]排列perm (状态压缩+dp+同余定理)

1072: [SCOI2007]排列perm Time Limit: 10 Sec Memory Limit: 128 MB Submit: 2537 Solved: 1583 [Submit][Status][Discuss] Description   给一个数字串s和正整数d, 统计s有多少种不同的排列能被d整除(可以有前导0)。例如123434有90种排列能 被2整除,其中末位为2的有30种,末位为4的有60种。 Input   输入第一行是一个整数T,表示测试数据的个数,以下每行一组s...
阅读(254) 评论(0)

2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem (状态压缩)

The frequent subset problem is defined as follows. Suppose UU={1, 2,\ldots…,N} is the universe, and S_{1}S ​1 ​​ , S_{2}S ​2 ​​ ,\ldots…,S_{M}S ​M ​​ are MM sets over UU. Given a positive constant \alphaα, 0<\alpha \leq 10<α≤1, a subset BB (B \neq 0B≠0) is...
阅读(356) 评论(8)

BZOJ 1911 [Apio2010]特别行动队 (斜率优化DP)

1911: [Apio2010]特别行动队 Time Limit: 4 Sec Memory Limit: 64 MB Submit: 4841 Solved: 2362 [Submit][Status][Discuss] Description Input Output Sample Input 4 -1 10 -20 2 2 3 4 Sample Output 9 HINT...
阅读(198) 评论(0)

BZOJ 1010 [HNOI2008]玩具装箱toy (斜率优化DP)

1010: [HNOI2008]玩具装箱toy Time Limit: 1 Sec Memory Limit: 162 MB Submit: 11388 Solved: 4801 [Submit][Status][Discuss] Description   P教授要去看奥运,但是他舍不下他的玩具,于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压 缩,其可以将任意物品变成一堆,再放到一种特殊的一维容器中。P教授有编号为1...N的N件玩具,第i件玩具经过 压缩后变成一维长度为Ci.为了方便整...
阅读(353) 评论(0)

HDU 3507 Print Article (斜率优化DP)

Print Article Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 13922 Accepted Submission(s): 4317 Problem Description Zero has an old printer that doesn't work well sometimes. As it is antique,...
阅读(289) 评论(0)

BZOJ 1003 物流运输 (spfa+dp)

传送门:点击打开链接 1003: [ZJOI2006]物流运输 Time Limit: 10 Sec  Memory Limit: 162 MB Submit: 8310  Solved: 3493 [Submit][Status][Discuss] Description   物流公司要把一批货物从码头A运到码头B。由于货物量比较大,需要n天才能运完。货物运输过程中一般要...
阅读(230) 评论(0)

HDU 1074 Doing Homework (dp+状态压缩+路径记录)

Doing Homework Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9864 Accepted Submission(s): 4716 Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot ...
阅读(374) 评论(0)

HDU 1024 Max Sum Plus Plus(最大m子段和)

Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30716 Accepted Submission(s): 10846 Problem Description Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be...
阅读(427) 评论(0)

HDU 1078 FatMouse and Cheese (记忆化搜索)

FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10811 Accepted Submission(s): 4598 Problem Description FatMouse has stored some cheese in a city. The city can be considered ...
阅读(266) 评论(0)

HDU 1160 FatMouse's Speed (dp+路径记录)

FatMouse's Speed Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16972 Accepted Submission(s): 7507 Special Judge Problem Description FatMouse believes that the fatter a mouse is, the faster it...
阅读(92) 评论(0)

动态规划专题(持续更新中)

HDU 1159  Common Subsequence 传送门:点击打开链接 最长公共子序列,模板题。dp[i][j]表示第一个串中前i个字符跟第二个串中前j个字符的相等数目。 状态转移方程:如果两者相等 dp[i][j]=dp[i-1][j-1]+1;否则 dp[i][j]=max(dp[i-1][j],dp[i][j-1])。 题解:点击打开链接 H...
阅读(109) 评论(0)

HDU 1087 Super Jumping! Jumping! Jumping!(最大上升子序列和)

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 40087 Accepted Submission(s): 18464 Problem Description Nowadays, a kind of chess game called “Super Jumping! Ju...
阅读(414) 评论(0)

HDU 5543 Pick The Sticks(0-1背包)

Pick The Sticks Time Limit: 15000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 2063 Accepted Submission(s): 657 Problem Description The story happened long long ago. One day, Cao Cao made a special order ca...
阅读(358) 评论(0)

HDU 1159 Common Subsequence (最长公共子序列)

Common Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 40565 Accepted Submission(s): 18717 Problem Description A subsequence of a given sequence is the given sequence with some elem...
阅读(326) 评论(0)
20条 共2页1 2 下一页 尾页
    个人资料
    • 访问:34695次
    • 积分:1586
    • 等级:
    • 排名:千里之外
    • 原创:127篇
    • 转载:1篇
    • 译文:0篇
    • 评论:13条
    联系方式
    欢迎谈论交流:1245985209
    博客专栏
    最新评论