- 博客(92)
- 收藏
- 关注
RSS订阅转载 方砖问题（动态规划）
Problem A: 方砖问题Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 6 Solved: 2[Submit][Status][Web Board]Description用边长小于N的正方形方砖（注意，不要求所有的方砖大小相同，请看样例说明）不重叠地铺满N*N的正方形房间，最少要几块方砖。可以将n*n的大
2015-07-31 19:17:57
3892
2
转载 不要62（数位Dp）
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25374 Accepted Submission(s): 8782Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：
2015-07-28 15:01:50
369
转载 Bomb（数位Dp）
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 10373 Accepted Submission(s): 3657Problem DescriptionThe counter-terrori
2015-07-27 17:49:43
489
转载 威威猫系列故事——打地鼠(简单Dp填数)
威威猫系列故事——打地鼠Time Limit: 300/100 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2333 Accepted Submission(s): 1139Problem Description 威威猫最近不务正业，每天沉
2015-07-27 14:55:00
488
转载 Watch The Movie（严格限制数量的二维费用背包）
Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 6454 Accepted Submission(s): 2066Problem DescriptionNew semest
2015-07-26 20:00:31
343
转载 FATE(二维费用背包)
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9596 Accepted Submission(s): 4516Problem Description最近xhd正在玩一款叫做FATE的游戏，为
2015-07-26 16:58:59
399
转载 Tug of War（严格限制数量的二维费用背包）
Tug of WarTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8500 Accepted: 2311DescriptionA tug of war is to be arranged at the local office picnic. For t
2015-07-26 15:54:34
660
转载 二维费用背包
问题二维费用的背包问题是指：对于每件物品，具有两种不同的费用；选择这件物品必须同时付出这两种代价；对于每种代价都有 一个可付出的最大值（背包容量）。问怎样选择物品可以得到最大的价值。设这两种代价分别为代价1和代价2，第i件物品所需的两种代价分别为a[i]和 b[i]。两种代价可付出的最大值（两种背包容量）分别为V和U。物品的价值为w[i]。算法费用加了一维，只需状态也加一维
2015-07-26 15:52:17
1095
转载 Specialized Four-Digit Numbers(进制转换)
Specialized Four-Digit NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4978 Accepted Submission(s): 3597Problem Descriptio
2015-07-25 20:09:03
469
转载 进制转换（进制转换）
进制转换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31674 Accepted Submission(s): 17612Problem Description输入一个十进制数N，将它转换成R进制数
2015-07-25 19:07:40
937
转载 使用栈实现进制转换（大数进制转换）
Problem A: 使用栈实现进制转换Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 62 Solved: 37[Submit][Status][Web Board]Description使用栈将一个很长（>30）的十进制数转换为二进制数Input若干个很长的十进制数每行一个
2015-07-25 18:37:49
2745
转载 NUMBER BASE CONVERSION（大数进制转换）
NUMBER BASE CONVERSIONTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4580 Accepted: 2095DescriptionWrite a program to convert numbers in one base to nu
2015-07-25 18:32:59
1044
转载 A计划（bfs）
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12734 Accepted Submission(s): 3109Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们
2015-07-25 11:33:38
445
转载 采药（01背包）
1753: 采药Time Limit: 0 Sec Memory Limit: 128 MBSubmit: 10 Solved: 8[Submit][Status][Web Board]Description辰辰是个天资聪颖的孩子，他的梦想是成为世界上最伟大的医师。为此，他想拜附近最有威望的医师为师。医师为了判断他的资质，给他出了一个难题。医师把他带到一个到
2015-07-25 10:52:46
553
转载 Tempter of the Bone(DFS+剪枝)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 87885 Accepted Submission(s): 23909Problem DescriptionThe
2015-07-24 20:31:25
397
转载 钱币兑换问题（完全背包）
钱币兑换问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7465 Accepted Submission(s): 4407Problem Description在一个国家仅有1分，2分，3分硬币，将
2015-07-24 16:51:34
460
转载 钱币兑换问题（母函数）
钱币兑换问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7461 Accepted Submission(s): 4403Problem Description在一个国家仅有1分，2分，3分硬币，将
2015-07-24 16:22:37
547
转载 AGTC(动态规划-最短编辑距离)
AGTCTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10742 Accepted: 4133DescriptionLet x and y be two strings over some finite alphabet A. We would like
2015-07-24 15:05:19
685
转载 字符串的修改（动态规划-最短编辑距离）
1187: 字符串的修改Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 6 Solved: 5[Submit][Status][Web Board]Description设A和B是两个字符串。我们要用最少的字符操作次数，将字符串A转换为字符串B。这里所说的字符操作共有三种： 1. 删除一个字符； 2.
2015-07-24 15:01:18
4049
转载 过河卒（动态规划）
Problem E: 过河卒Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 7 Solved: 2[Submit][Status][Web Board]Description如图，A 点有一个过河卒，需要走到目标 B 点。卒行走规则：可以向下、或者向右。同时在棋盘上的任一点有一个对方的马（如上图的C点），该马所在的
2015-07-24 13:12:55
928
转载 Common Subsequence（最长公共字串-动态规划）
Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27834 Accepted Submission(s): 12392Problem DescriptionA sub
2015-07-23 21:38:02
425
转载 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): 26990 Accepted Submission(s): 11952Problem Descri
2015-07-23 10:02:27
391
转载 数字统计(区间数字)
1206: 数字统计Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 8 Solved: 3[Submit][Status][Web Board]Description一本书的页码从自然数1 开始顺序编码直到自然数n。书的页码按照通常的习惯编排， 每个页码都不含多余的前导数字0。例如，第6 页用数字6 表示，而不
2015-07-22 20:54:51
892
转载 The Counting Problem（区间数数，很好哦！）
The Counting ProblemTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3680 Accepted: 1949DescriptionGiven two integers a and b, we write the numbers betwe
2015-07-22 19:45:02
1237
转载 How many 0's?(求区间某一个数的个数，好题)
How many 0's?Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3207 Accepted: 1707DescriptionA Benedict monk No.16 writes down the decimal representations
2015-07-22 19:27:22
419
转载 排列（c++ stl+哈希）
Problem E: 排列Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 64 Solved: 16[Submit][Status][Web Board]DescriptionRay又对数字的列产生了兴趣: 现有四张卡片，用这四张卡片能排列出很多不同的4位数，要求按从小到大的顺序输出这些4位数。Inpu
2015-07-22 16:36:47
685
转载 Tight Words(数位DP)
#include#include#includeusing namespace std;double dp[105][12];int main(){ int k,n,i,j; double gailv,sum; while(cin>>k>>n) { sum=0.0; if(n<=1) {
2015-07-22 14:40:25
408
转载 Ferry Loading IV（队列）
Problem G: Ferry Loading IVTime Limit: 10 Sec Memory Limit: 128 MBSubmit: 11 Solved: 5[Submit][Status][Web Board]DescriptionBefore bridges were common, ferries were used to transpo
2015-07-22 13:12:06
861
转载 A + B for you again(KMP)
A + B for you againTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4940 Accepted Submission(s): 1248Problem DescriptionGenera
2015-07-21 20:48:23
334
转载 Number Sequence（kmp模板）
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14210 Accepted Submission(s): 6306Problem DescriptionGiven tw
2015-07-21 15:27:36
338
转载 病毒侵袭持续中（AC自动机）
病毒侵袭持续中Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8183 Accepted Submission(s): 2858Problem Description小t非常感谢大家帮忙解决了他的上一个
2015-07-20 19:54:45
390
转载 病毒侵袭（AC自动机）
病毒侵袭Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14516 Accepted Submission(s): 3732Problem Description当太阳的光辉逐渐被月亮遮蔽，世界失去了光
2015-07-20 19:53:46
438
转载 Keywords Search(AC自动机)
Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43061 Accepted Submission(s): 13550Problem DescriptionIn the m
2015-07-20 19:52:35
499
转载 生日日数（java处理日期，日期加法）
1225: 生日日数Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 23 Solved: 9[Submit][Status][Web Board]DescriptionCCC老师的生日是YY年MM月DD日，他想知道自己出生后第一万天纪念日的日期（出生日算第0天）。Input输入有多行，格式为
2015-07-20 17:21:31
1441
转载 第几天（java处理日期）
1231: 第几天Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 24 Solved: 20[Submit][Status][Web Board]Description给定一个日期，输出这个日期是该年的第几天。Input输入数据有多组，每组占一行，数据格式为YYYY/MM/DD组成，具体参见
2015-07-20 17:07:27
672
转载 java处理日期
比如：现在是2004-03-26 13：31：40 过去是：2004-01-02 11：30：24我现在要获得两个日期差，差的形式为：XX天XX小时XX分XX秒方法一：DateFormat df = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss");try{ Date d1 = df.parse("2004-03-
2015-07-20 17:04:14
331
转载 使用栈实现进制转换(java大数进制转换)
Problem A: 使用栈实现进制转换Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 35 Solved: 19[Submit][Status][Web Board]Description使用栈将一个很长（>30）的十进制数转换为二进制数Input若干个很长的十进制数每行一个
2015-07-20 16:16:28
2470
转载 Holding Bin-Laden Captive!（母函数）
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17172 Accepted Submission(s): 7702Problem Description
2015-07-18 10:55:08
369
转载 Problem F: 瑞士轮（快速排序过不了）
Problem F: 瑞士轮Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 12 Solved: 2[Submit][Status][Web Board]Description在双人对决的竞技性比赛，如乒乓球、羽毛球、国际象棋中，最常见的赛制是淘汰赛和循环赛。前者的特点是比赛场数少，每场都紧张刺激，但偶然性较高。后
2015-07-17 19:21:41
825
转载 The kth great number(C++ stl multiset的应用)
The kth great numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 8117 Accepted Submission(s): 3215Problem DescriptionXiao
2015-07-16 15:07:23
518
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人