题解报告
文章平均质量分 79
x__1998
这个作者很懒,什么都没留下…
展开
-
HDU - 1043 Eight(八数码+康拓展开式+BFS暴力打表)
EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Special JudgeProblem DescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by ...原创 2018-04-15 16:47:11 · 383 阅读 · 0 评论 -
POJ - 3660 Cow Contest(flody在路径连通性的应用)
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14306 Accepted: 8013DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As w...原创 2018-04-21 20:29:28 · 219 阅读 · 0 评论 -
POJ - 1961 Period(KMP求最短循环节)
PeriodTime Limit: 3000MS Memory Limit: 30000KDescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether...原创 2018-05-12 12:35:23 · 492 阅读 · 0 评论 -
POJ - 2408 Anagram Groups(让人窒息的字符串桶排序)
Anagram GroupsTime Limit: 1000MS Memory Limit: 65536KDescriptionWorld-renowned Prof. A. N. Agram's current research deals with large anagram groups. He has just found a new application for his theory...原创 2018-05-12 13:25:20 · 1176 阅读 · 0 评论 -
HDU - 3068 最长回文(马拉车算法模板)
Problem Description给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度.回文就是正反读都是一样的字符串,如aba, abba等Input输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S两组case之间由空行隔开(该空行不用处理)字符串长度len <= 110000Output每一行一个整数x...原创 2018-05-12 14:01:06 · 1635 阅读 · 0 评论 -
POJ - 1988 Cube Stacking(带权并查集)
Cube StackingTime Limit: 2000MS Memory Limit: 30000KDescriptionFarmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, e...原创 2018-05-12 14:31:55 · 218 阅读 · 0 评论 -
POJ - 1797 Heavy Transportation
Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KDescriptionBackground Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever ...原创 2018-05-12 15:07:09 · 155 阅读 · 0 评论 -
POJ - 3268 Silver Cow Party (dijkstra求多个点到一个点最短路径的小技巧)
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤...原创 2018-05-12 15:20:39 · 510 阅读 · 0 评论 -
POJ - 1847 Tram
TramTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17999 Accepted: 6711DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of them. In every in...原创 2018-05-12 15:32:10 · 239 阅读 · 0 评论 -
POJ - 2240 Arbitrage
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26591 Accepted: 11214DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency ...原创 2018-05-12 15:38:54 · 267 阅读 · 0 评论 -
HDU - 2896 病毒侵袭(AC自动机模板)
病毒侵袭Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33670 Accepted Submission(s): 7578Problem Description当太阳的光辉逐渐被月亮遮蔽,世界失去了光明,大地迎来最黑暗的时刻。。。。...原创 2018-05-12 15:43:42 · 308 阅读 · 0 评论 -
HDU - 1869 六度分离
六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11591 Accepted Submission(s): 4683Problem Description1967年,美国著名的社会学家斯坦利·米尔格兰姆提出了一个名为“小世界现...原创 2018-05-12 16:06:20 · 210 阅读 · 0 评论 -
POJ-1062 昂贵的聘礼(dijkstra新源点到旧源点的边权的移交)
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KDescription年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要50...原创 2018-04-22 13:30:58 · 219 阅读 · 0 评论 -
POJ 3083 Children of the Candy Corn
DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors o...原创 2018-02-16 16:54:36 · 221 阅读 · 0 评论 -
POJ - 3253 Fence Repair(哈夫曼树+优先队列)
Fence RepairTime Limit: 2000MS Memory Limit: 65536KDescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,0...原创 2018-04-15 16:10:12 · 222 阅读 · 0 评论 -
FZU - 2150 Fire Game (双向BFS+判断连通块)
Problem 2150 Fire Game Time Limit: 1000 mSec Memory Limit : 32768 KBProblem DescriptionFat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the b...原创 2018-04-15 15:09:37 · 186 阅读 · 0 评论 -
HDU 1166 敌兵布阵(树状数组)
C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。中央情报局要研究敌人究竟演习什么战术,所以T...原创 2018-03-11 15:31:12 · 116 阅读 · 0 评论 -
HDU 1285 确定比赛名次(拓扑排序)
Problem Description有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员会不能直接获得每个队的比赛成绩,只知道每场比赛的结果,即P1赢P2,用P1,P2表示,排名时P1在P2之前。现在请你编程序确定排名。 Input输入有若干组,每组中的第一行为二个数N(1<=N&...原创 2018-03-08 19:40:42 · 169 阅读 · 0 评论 -
Openjudge 2728 摘花生(二维DP入门)
描述Hello Kitty 想摘点花生送给她喜欢的米老鼠。她来到一片有网格状道路的矩形花生地(如下图),从西北角进去,东南角出来。地里每个道路的交叉点上都有种着一株花生苗,上面有若干颗花生,经过一株花生苗就能摘走该它上面所有的花生。Hello Kitty只能向东或向南走,不能向西或向北走。问Hello Kitty 最多能够摘到多少颗花生。输入第一行是一个整数T,代表一共有多少组数据。1<=T...原创 2018-03-06 21:30:50 · 1097 阅读 · 0 评论 -
hdu1232 畅通工程(并查集)
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 61695 Accepted Submission(s): 33036Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连...原创 2018-03-05 21:19:36 · 227 阅读 · 0 评论 -
ZOJ - 3818 Pretty Poem
Pretty Poem Poetry is a form of literature that uses aesthetic and rhythmic qualities of language. There are many famous poets in the contemporary era. It is said that a few ACM-ICPC contestants can e...原创 2018-02-27 15:43:54 · 235 阅读 · 0 评论 -
HDU1711 Number Sequence(KMP算法模板题)
Problem DescriptionGiven 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 mak...原创 2018-02-18 22:40:03 · 230 阅读 · 0 评论 -
POJ1426 Find The Multiple
DescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 20...原创 2018-02-17 14:53:15 · 139 阅读 · 0 评论 -
HDU2510 数字三角形
符号三角形的 第1行有n个由“+”和”-“组成的符号 ,以后每行符号比上行少1个,2个同号下面是”+“,2个异 号下面是”-“ 。计算有多少个不同的符号三角形,使其所含”+“ 和”-“ 的个数相同 。 n=7时的1个符号三角形如下: + + - + - + + + - - - - + - + + + - - + + - - + - - - + Input每行1个正整数n <=24,n=0退出...原创 2018-02-16 12:30:04 · 328 阅读 · 0 评论 -
POJ2531 Network Saboteur
A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize tr...原创 2018-02-13 19:07:15 · 252 阅读 · 0 评论 -
HDU - 1317 XYZZY
XYZZYTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6667 Accepted Submission(s): 1928Problem DescriptionIt has recently been discovered how ...原创 2018-05-25 23:31:45 · 298 阅读 · 0 评论