关闭

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)...
阅读(292) 评论(0)

数位dp练习(记忆化搜索)HDU 2089 不要62

不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 45764 Accepted Submission(s): 17240 Problem Description 杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可...
阅读(379) 评论(0)

2017ICPC北方邀请赛H题 MJF wants to work(贪心)

4203: MJF wants to work 时间限制: 1 Sec 内存限制: 128 MB 提交: 60 解决: 11 [提交][状态][讨论版] 题目描述 MJF feel the summer vacation is very leisure. So he wants to work to earn money. There are n jobs MJF can take part in.For job i, it has the start time ti.x, the end time...
阅读(499) 评论(0)

ACM暑假训练第3场中石油集训题(记忆化搜索,dp,树状数组)

问题 A: Why Did the Cow Cross the Road 时间限制: 1 Sec 内存限制:128 MB 提交: 148 解决: 23 [提交][状态][讨论版] 题目描述 Why did the cow cross the road? Well, one reason is that Farmer John's farm simply has a lot of roads, making it impossible for his cows to travel around wit...
阅读(201) 评论(0)

51nod 1625 夹克爷发红包,暴力+贪心

1625 夹克爷发红包 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 在公司年会上,做为互联网巨头51nod掌门人的夹克老爷当然不会放过任何发红包的机会。 现场有n排m列观众,夹克老爷会为每一名观众送出普通现金红包,每个红包内金额随机。 接下来,夹克老爷又送出最多k组高级红包,每组高级红包会同时给一排...
阅读(184) 评论(0)
7条 共2页1 2 下一页 尾页
    个人资料
    • 访问:39911次
    • 积分:1735
    • 等级:
    • 排名:千里之外
    • 原创:127篇
    • 转载:10篇
    • 译文:0篇
    • 评论:26条
    博客专栏
    最新评论