2018年04月_Li-金玉良言

05月 04月 03月 01月

原创 hdu-1422-重温世界杯-最长和不小于0的子串-C++

重温世界杯 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7528 Accepted Submission(s): 2663 Problem Description 世界杯结束了,意大利人连本带利的收回了法国人6年

2018-04-26 17:33:20 206

原创 hdu-1503-Advanced Fruits-lcs-java

Advanced Fruits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4409 Accepted Submission(s): 2305 Special Judge Problem Description T

2018-04-25 20:36:19 147

原创 hdu-1114-Piggy-Bank-dp-java

Piggy-Bank Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 31659 Accepted Submission(s): 15773 Problem Description Before ACM can do

2018-04-25 17:45:05 254

原创 hdu-1421-搬寝室-dp-java

搬寝室 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 31472 Accepted Submission(s): 10770 Problem Description 搬寝室是很累的,xhd深有体会.时间追述2006

2018-04-24 18:30:42 221

原创 hdu-2084-数塔-dp-java

数塔 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 53741 Accepted Submission(s): 31567 Problem Description 在讲述DP算法的时候，一个经典的例子就是数塔问题，

2018-04-24 10:27:45 261

原创 hdu-2159-FATE-dp-java

FATE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17403 Accepted Submission(s): 8172 Problem Description 最近xhd正在玩一款叫做FATE的游戏，为了得到

2018-04-24 10:02:49 171

原创 hdu-1864-最大报销额-dp-java

最大报销额 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 30003 Accepted Submission(s): 9215 Problem Description 现有一笔经费可以报销一定额度的发票。允许报销的

2018-04-23 19:31:17 246

原创 hdu-2955-Robberies-dp-java

Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to

2018-04-22 21:24:18 209

原创 hdu-1711-Number Sequence-kmp-java

Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b

2018-04-21 17:37:49 397

原创 hdu-1074-Doing Homework-状态压缩dp-java

Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in

2018-04-21 15:22:17 249

原创 hdu-1671-Phone List-字典树-java

Phone ListTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23475 Accepted Submission(s): 7888Problem Description Given a list of phone numbers...

2018-04-19 14:18:13 284

原创 poj-1837-dp-java

Balance Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 15844 Accepted: 9987 Description Gigel has a strange "balance" and he wants to poise it. Actually, th

2018-04-12 14:52:02 304

原创蓝桥杯-正则问题-栈应用-java

历届试题正则问题时间限制：1.0s 内存限制：256.0MB 问题描述　　考虑一种简单的正则表达式：　　只由 x ( ) | 组成的正则表达式。　　小明想求出这个正则表达式能接受的最长字符串的长度。　　例如 ((xx|xxx)x|(x|xx))xx 能接受的最长字符串是： xxxxxx，长度是6。输入格式　　一

2018-04-03 13:14:39 633

TA关注的人

lijinyuliangyan的博客