关闭

ICPC2017网络赛(南宁)子序列最大权值(树状数组+dp)

Let SS be a sequence of integers s_{1}s ​1 ​​ , s_{2}s ​2 ​​ , ......, s_{n}s ​n ​​ Each integer is is associated with a weight by the following rules: (1) If is is negative, then its weight is 00. (2) If is is greater than or equal to 1000010000, then its...
阅读(228) 评论(0)

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

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

ICPC2017网络赛(沈阳)1012&HDU6205Card(最大子段和)

card card card Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 74 Accepted Submission(s): 28 Problem Description As a fan of Doudizhu, WYJ likes collecting playing cards very much. One day, M...
阅读(977) 评论(0)

bzoj 1003 [ZJOI2006]物流运输(最短路spfa+dp)

1003: [ZJOI2006]物流运输 Time Limit: 10 Sec Memory Limit: 162 MB Submit: 8303 Solved: 3489 [Submit][Status][Discuss] Description   物流公司要把一批货物从码头A运到码头B。由于货物量比较大,需要n天才能运完。货物运输过程中一般要转 停好几个码头。物流公司通常会设计一条固定的运输路线,以便对整个运输过程实施严格的管理和跟踪。由于各种 因素的存在,有的时候某个码头会无法装卸货物。这时...
阅读(327) 评论(0)

HDU 4734 F(x) 数位dp

F(x) Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6341 Accepted Submission(s): 2438 Problem Description For a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x)...
阅读(297) 评论(0)
21条 共5页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:41939次
    • 积分:1791
    • 等级:
    • 排名:千里之外
    • 原创:125篇
    • 转载:9篇
    • 译文:0篇
    • 评论:28条
    博客专栏
    最新评论