- 博客(12)
- 收藏
- 关注
原创 Hdu1084 What Is Your Grade?
What Is Your Grade?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description“Point, point, life of student!”This is a ballad(歌谣)well known in
2013-06-12 11:37:27 993
原创 Hdu 4571Travel in time2013长沙邀请赛
Travel in timeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 167 Accepted Submission(s): 36Problem Description Bob gets tired o
2013-06-03 22:03:19 1109
原创 Hdu 4573 Throw the Stones 2013长沙邀请赛
Throw the StonesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13 Accepted Submission(s): 2Problem Description Remember our chi
2013-06-03 22:01:01 1523
原创 Hdu 4572 Bottles Arrangement 2013长沙邀请赛
Bottles ArrangementTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description Hunan cuisine is really wonderful! But if you don’t like spicy food
2013-06-03 21:59:07 2316 3
原创 Hdu 4575 Changsha Marathon 2013长沙邀请赛
Changsha MarathonTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16 Accepted Submission(s): 1Problem Description Changsha is a b
2013-06-03 21:57:57 1870
原创 Hdu 4569 Special equations 2013长沙邀请赛
Special equationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20 Accepted Submission(s): 12Special JudgeProblem Description L
2013-06-03 21:56:25 1414
原创 Hdu 4566 Circle Game 2013长沙邀请赛
Circle GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2 Accepted Submission(s): 0Problem Description You must have some k
2013-06-03 21:48:06 2993 2
原创 Hdu 4565 So easy! 2013长沙邀请赛
So Easy!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 133 Accepted Submission(s): 43Problem Description A sequence Sn is defin
2013-06-03 21:24:38 1498
原创 Hdu2209 翻纸牌游戏
Problem Description有一种纸牌游戏,很有意思,给你N张纸牌,一字排开,纸牌有正反两面,开始的纸牌可能是一种乱的状态(有些朝正,有些朝反),现在你需要整理这些纸牌。但是麻烦的是,每当你翻一张纸牌(由正翻到反,或者有反翻到正)时,他左右两张纸牌(最左边和最右边的纸牌,只会影响附近一张)也必须跟着翻动,现在给你一个乱的状态,问你能否把他们整理好,使得每张纸牌都正面朝上,如果可以
2013-06-02 15:09:51 1176
原创 Hdu 1874 畅通工程续
题目大意:求定起点终点的最短距离。一样的思路,用dijkstra 存下每个节点到起点的最短距离,输出终点的最短距离即可。代码如下:/*Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已知起
2013-06-01 12:26:06 792
原创 DP ( 8 ) Max Sum Hdu1003
题意:求最大的片段和,并保存片段和的起点pre和终点end。就是一个简单的DP:dp[i-1]>=0 , dp[i] = dp[i-1]+a[i];最大片段和的起点不用改变。dp 代码如下:#include#define M 100005int a[M],dp[M],pre[M];int main(){ int t,n,i,j; scanf("%d",&t);
2013-06-01 12:20:43 699
原创 Hdu 2066 一个人的旅行
题目大意:求最短路。表面上看去是个多源最短路,不好处理,但是只要再构造一个“0”号节点,作为草儿的家,和草儿相邻的城市到家的距离为0,这样,就只需要求从草儿家里到多个想去的城市的最短距离,就可以用最简单的dijkstra算法来做了。代码:/*Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途
2013-06-01 11:33:40 893
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人