- 博客(19)
- 收藏
- 关注
原创 hdu 2647 Reward (拓扑排序)
RewardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3554 Accepted Submission(s): 1077Problem DescriptionDandelion's uncle i
2014-05-28 21:19:51 1140
原创 hdu 2112 HDU Today (dijkstra)
HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13235 Accepted Submission(s): 3096Problem Description经过锦囊相助,海东集团终于度
2014-05-27 21:13:03 635
原创 hdu 1869 六度分离(floyd算法)
六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3911 Accepted Submission(s): 1592Problem Description1967年,美国著名的社会学家斯坦利·米尔
2014-05-27 17:29:49 764
原创 bnu 沙漠之旅 (二维背包)
沙漠之旅Time Limit: 1000msMemory Limit: 655“小胖要穿越一片沙漠,小胖开着一辆大吉普,小胖的吉普油耗高,吉普能放四桶油。”这就是人人会唱的沙漠之歌~~体现了小胖拔群的聪明才智。小胖的问题是这样的:现在需要驾车穿越一片沙漠,总的行驶路程为L。小胖的吉普装满油能行驶X距离,同时其后备箱最多能放下四桶油。在起点有N种汽
2014-05-23 16:09:06 851
原创 poj 1125 Stockbroker Grapevine
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25611 Accepted: 14145DescriptionStockbrokers are known to overreact to rumours. Y
2014-05-23 10:51:34 621
原创 poj 1062 昂贵的聘礼
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35274 Accepted: 10098Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿
2014-05-23 10:01:42 769
原创 NYOJ 247 虚拟的城市之旅(spfa求单源最短路)
虚拟的城市之旅时间限制:3000 ms | 内存限制:65535 KB难度:6描述展馆是未来城市的缩影,个人体验和互动是不变的主题。在A国展馆通过多维模式和高科技手段,引领参观者在展示空间踏上一段虚拟的城市之旅。梦幻国有N个城市和M条道路,每条道路连接某两个城市。任意两个城市之间最多只有一条道路直接相连。这M条道路中有一部分为单向通行的道路,一部
2014-05-21 18:31:02 911
原创 poj 3667 Hotel
HotelTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 10959 Accepted: 4732DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cul
2014-05-21 12:13:49 783
原创 hdu1513&&poj 1159 Palindrome(LCS+滚动数组)
PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 50914 Accepted: 17537DescriptionA palindrome is a symmetrical string, that is, a string read
2014-05-20 17:08:47 823
原创 poj 1836 Alignment (LIS变形)
AlignmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12571 Accepted: 4021DescriptionIn the army, a platoon is composed by n soldiers. During the m
2014-05-20 16:05:58 717
原创 poj 1837 Balance (01背包变形)
BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10065 Accepted: 6231DescriptionGigel has a strange "balance" and he wants to poise it. Actually
2014-05-20 15:56:43 658
原创 hdu 3336 Count the string (DP+kmp)
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4239 Accepted Submission(s): 1977Problem DescriptionIt is wel
2014-05-12 12:22:19 777
原创 hdu 1686 Oulipo (KMP模板)
OulipoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4187 Accepted Submission(s): 1660Problem DescriptionThe French author G
2014-05-10 18:32:30 764
转载 KMP算法
KMP是一个高效的字符串匹配算法,它是由三位计算机学者 D.E.Knuth 与 V.R.Pratt 和 J.H.Morris 同时发现的,因此人们通常简称它为 KMP 算法。可以证明它的时间复杂度为O(m+n),直观地看,是因为在匹配过程中指针 i 没有回溯。KMP算法的核心思想是利用已经得到的部分匹配信息来进行后面的匹配过程。一般匹配算法中,进行"两个子串的比较"过程中,不管是T串的第几
2014-05-10 18:27:14 533
原创 快速幂取模算法模板
int powmod(int a,int b,int c){ int s=1; a%=c; while(b) { if(b%2) s=(s*a)%c; b/=2; a=(a*a)%c; } return s;}
2014-05-09 20:31:09 591
原创 poj 1700 Crossing River
Crossing RiverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10218 Accepted: 3859DescriptionA group of N people wishes to go across a river with only
2014-05-09 11:15:57 772
原创 hdu 1598 find the most comfortable road
find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3369 Accepted Submission(s): 1437Problem Descriptio
2014-05-07 09:30:25 695
原创 poj 1014 Dividing (多重背包模板)
DividingTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 57229 Accepted: 14680 DescriptionMarsha and Bill own a collection of marbles. They want to split the co...
2014-05-03 17:12:58 924
原创 NYOJ 12 喷水装置(二)
喷水装置(二)时间限制:3000 ms | 内存限制:65535 KB难度:4描述有一块草坪,横向长w,纵向长为h,在它的橫向中心线上不同位置处装有n(n<=10000)个点状的喷水装置,每个喷水装置i喷水的效果是让以它为中心半径为Ri的圆都被润湿。请在给出的喷水装置中选择尽量少的喷水装置,把整个草坪全部润湿。输入第一行输入一个正整数N表示共有n次测
2014-05-01 23:43:56 1146
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人