- 博客(14)
- 收藏
- 关注
RSS订阅原创 HDU 1039 Easier Done Than Said? (字符串）
Easier Done Than Said?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14083 Accepted Submission(s): 6827Problem DescriptionPa
2017-09-07 22:02:19
187
原创 HDU 1038 Biker's Trip Odometer （水题）
Biker's Trip OdometerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6175 Accepted Submission(s): 4198Problem DescriptionMost
2017-09-05 21:56:53
164
原创 HDU 1037 Keep on Truckin' (水题）
Keep on Truckin'Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15128 Accepted Submission(s): 10416Problem DescriptionBoudrea
2017-09-05 21:01:32
468
原创 HDU 1036 Average is not Fast Enough! （水题）
Average is not Fast Enough!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6475 Accepted Submission(s): 2730Problem Description
2017-09-04 19:57:15
287
原创 HDU 1035 Robot Motion（水题，模拟）
Robot MotionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11190 Accepted Submission(s): 5303Problem DescriptionA robot
2017-08-17 16:15:30
383
原创 HDU 1034 Candy Sharing Game（水题）
Candy Sharing GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6781 Accepted Submission(s): 4131Problem DescriptionA numbe
2017-08-17 14:43:41
259
1
原创 HDU 1033 Edge（水题）
EdgeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3857 Accepted Submission(s): 2395Problem DescriptionFor products that are
2017-08-17 13:59:59
242
原创 HDU 1032 The 3n + 1 problem（水题）
The 3n + 1 problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40103 Accepted Submission(s): 14659Problem DescriptionProbl
2017-08-17 10:39:32
216
原创 HDU 1031 Design T-Shirt（结构体排序）
Design T-ShirtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10218 Accepted Submission(s): 4877Problem DescriptionSoon after
2017-08-17 10:03:23
234
原创 HDU 1029 Ignatius and the Princess IV（水题）
Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 34165 Accepted Submission(s): 14876Problem Descriptio
2017-08-17 09:11:15
139
原创 HDU 1030 Delta-wave（找规律）
Delta-waveTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9452 Accepted Submission(s): 3774Problem DescriptionA triangle fiel
2017-08-17 08:46:16
301
1
原创 HDU 1028 Ignatius and the Princess III（DP，整数划分）
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22498 Accepted Submission(s): 15713Problem Descripti
2017-08-16 21:39:49
212
原创 HDU 1027 Ignatius and the Princess II（全排列next_permutation函数)
Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8658 Accepted Submission(s): 5099Problem Description
2017-08-16 21:08:37
142
原创 HDU 1026 Ignatius and the Princess I（BFS、优先队列）
看到这一题首先想到的是深搜或者dp，后来深入了解了一下题意，把dp否定了，然后尝试着用深搜去解。但是在模拟的过程中发现深搜的耗费会很大，于是就去网上搜了一下，网上大神是用广搜和优先队列，看了一下代码，有一种茅塞顿开的感觉。首先，采用map数组模拟墙、路和怪，flag数组存储走的方向，blood数组存储怪的血量；然后用重载排序的优先队列对当前节点的所有可能节点进行广搜；到达目的点后，对到
2017-08-16 19:47:06
154
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人