HDU
文章平均质量分 73
花落留香
超越仅发生在弯道时最省力
展开
-
Hdu---Text Reverse---1062 java版的注意
Text ReverseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13078 Accepted Submission(s): 4973Problem DescriptionIgnatius likes t原创 2013-07-28 22:05:31 · 984 阅读 · 0 评论 -
hdu--1811--并查集。。。半成品
#include#include#define MAX 100000int a[MAX];int find(int k){ while(a[k]!=k){ k=a[k]; } return k;}void marge(int x,int y){ int x1,y1; x1=find(x1); y1=find(y1); if(x1>y1)原创 2013-08-06 12:15:23 · 671 阅读 · 0 评论 -
hdu--1272--并查集(捏个捏个)
小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19668 Accepted Submission(s): 6014Problem Description上次Gardon的迷宫城堡小希玩了很久(见Pr原创 2013-08-06 12:13:41 · 731 阅读 · 0 评论 -
hdu--1232--并查集(很好理解)
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22654 Accepted Submission(s): 11825Problem Description某省调查城镇交通状况,得到现有城镇道路统计原创 2013-08-06 12:00:20 · 650 阅读 · 0 评论 -
hdu--1251--统计难题(字典树简单)
统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 13647 Accepted Submission(s): 5849Problem DescriptionIgnatius最近遇到一个难题,老师交给他很原创 2013-08-06 11:53:53 · 726 阅读 · 0 评论 -
Hdu--2544--最短路
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21906 Accepted Submission(s): 9323Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂原创 2013-07-30 18:57:34 · 740 阅读 · 0 评论 -
2553--Hdu--N皇后问题
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5563 Accepted Submission(s): 2518Problem Description在N*N的方格棋盘放置了N个皇后,使得它原创 2013-07-30 23:46:33 · 1063 阅读 · 1 评论 -
hdu--最短路径问题--3790
最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8231 Accepted Submission(s): 2461Problem Description给你n个点,m条无向边,每条边都有长度d和花费原创 2013-07-30 23:52:24 · 817 阅读 · 0 评论 -
hdu--1247--Hat’s Words(一般)
Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5772 Accepted Submission(s): 2154Problem DescriptionA hat’s word is a原创 2013-08-11 23:19:02 · 816 阅读 · 0 评论 -
hdu--1800--字典树&&其他
题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1800 根据题意可知:意思是有若干个飞行员,需要在扫帚上练习飞行,每个飞行员具有不同的等级,且等级高的飞行员可以当等级低的飞行员的老师,且每个飞行员至多有且只有一个老师和学生。具有老师和学生关系的飞行员可以在同一把扫帚上练习,并且这个性质具有传递性。即比如有A,B,C,D,E五个飞行员,且等级是原创 2013-08-12 17:52:05 · 891 阅读 · 0 评论 -
hdu-1003(java)-Max Sum (DP)
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 113992 Accepted Submission(s): 26372Problem DescriptionGiven a sequence a[原创 2013-08-13 16:11:43 · 914 阅读 · 0 评论 -
hdu--1518--DFS(C&&java深搜之简单)
SquareTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5902 Accepted Submission(s): 1882Problem DescriptionGiven a set of sti原创 2013-08-07 13:56:53 · 814 阅读 · 0 评论 -
hdu--1455--DFS(难度一般)
SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4757 Accepted Submission(s): 1320Problem DescriptionGeorge took sticks of t原创 2013-08-08 19:12:21 · 650 阅读 · 0 评论 -
hdu--1010--DFS--奇偶性剪枝
http://acm.hdu.edu.cn/showproblem.php?pid=1010奇偶剪枝分析:可以把map看成这样: 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0 1 0 1 从为 0 的格子走一步,必然走向为 1 的格子 从为 1原创 2013-08-08 21:24:25 · 1018 阅读 · 0 评论 -
Hdu--1008--Elevator
ElevatorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34085 Accepted Submission(s): 18562Problem DescriptionThe highest buildin原创 2013-08-02 13:32:22 · 802 阅读 · 0 评论 -
Hdu--1556--Color the ball(树状数组最简单运用)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5851 Accepted Submission(s): 3116Problem DescriptionN个气球排成一排,从左到右依次原创 2013-08-02 16:51:11 · 1019 阅读 · 5 评论 -
hdu--1106--排序(java版)
排序Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 49 Accepted Submission(s) : 17Font: Times New Roman | Verdana | GeorgiaFont Size: ← →原创 2013-08-03 12:38:41 · 767 阅读 · 0 评论 -
Hdu--N!--1042
N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43577 Accepted Submission(s): 12239Problem DescriptionGiven an integer N(0 ≤ N原创 2013-07-29 18:27:59 · 807 阅读 · 0 评论 -
hdu--1999--水
不可摸数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6737 Accepted Submission(s): 1752Problem Descriptions(n)是正整数n的真因子之和,即小于n且整除n的原创 2013-08-06 12:17:13 · 650 阅读 · 0 评论 -
hdu--1181--DFS(基础之一)
变形课Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 10099 Accepted Submission(s): 3765Problem Description呃......变形课上Harry碰到了一点小麻烦原创 2013-08-07 21:16:58 · 632 阅读 · 0 评论 -
hdu--DP(必须掌握)
//Made by syx//Time 2010年8月15日 10:13:12////小结:DP的基本思想 如果各个子问题不是独立的,不同的子问题的个数只是多项式量级,如果我们能够保存已经解决的子问题的答案,而在需要的时候再找出已求得的答案,这样就可以避免大量的重复计算。 由此而来的基本思路是——用一个表记录所有已解决的子问题的答案,不管该问题以后是否被转载 2013-08-10 11:09:44 · 771 阅读 · 0 评论 -
hdu--1075--(字典树一般)
What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 10424 Accepted Submission(s): 3320Problem Description原创 2013-08-10 10:37:17 · 847 阅读 · 0 评论 -
poj--1579--(DFS+记忆化搜索之经典)
记忆化搜索记忆化搜索:算法上依然是搜索的流程,但是搜索到的一些解用动态规划的那种思想和模式作一些保存。一般说来,动态规划总要遍历所有的状态,而搜索可以排除一些无效状态。更重要的是搜索还可以剪枝,可能剪去大量不必要的状态,因此在空间开销上往往比动态规划要低很多。记忆化算法在求解的时候还是按着自顶向下的顺序,但是每求解一个状态,就将它的解保存下来,以后再次遇到这个状态的时候原创 2013-08-09 11:52:28 · 765 阅读 · 0 评论 -
hdu--1010--DFS(奇偶性剪枝之经典)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54057 Accepted Submission(s): 14562Problem DescriptionThe dogg原创 2013-08-08 21:25:26 · 1259 阅读 · 0 评论 -
hdu--1231--最长子序列(DP)
最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15620 Accepted Submission(s): 6842Problem Description给定K个整数的序列{ N1, N2, ..原创 2013-08-13 20:19:22 · 833 阅读 · 0 评论