算法题
文章平均质量分 72
算法题
Crzis
人生若只如初见,何事秋风悲画扇。
等闲变却故人心,却道故人心易变。
展开
-
hdu 2077 汉诺塔IV(java && c)
汉诺塔IVTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5187 Accepted Submission(s): 3750Problem Description还记得汉诺塔III吗?他的规则是这样的:不允许直原创 2015-11-13 21:21:34 · 561 阅读 · 0 评论 -
汉诺塔经典
算法:当只有一个盘子的时候,只需要从将A塔上的一个盘子移到C塔上。 当A塔上有两个盘子是,先将A塔上的1号盘子(编号从上到下)移动到B塔上,再将A塔上的2号盘子移动的C塔上,最后将B塔上的小盘子移动到C塔上。 当A塔上有3个盘子时,先将A塔上编号1至2的盘子(共2个)移动到B塔上(需借助C塔),然后将A塔上的3号最大的盘子移动到C塔,最后转载 2015-11-13 20:09:12 · 419 阅读 · 0 评论 -
hdu 2284 Solve the puzzle, Save the world!(组合数)
Solve the puzzle, Save the world!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 163 Accepted Submission(s): 104Problem Description原创 2015-11-01 15:28:55 · 538 阅读 · 0 评论 -
hdu 2212 DFS
DFSTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6502 Accepted Submission(s): 3998Problem DescriptionA DFS(digital factorial su原创 2015-10-30 18:18:58 · 562 阅读 · 0 评论 -
我是菜鸟,我怕谁
我是菜鸟,我怕谁Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8244 Accepted Submission(s): 4812Problem Descriptionlin2144是一只小菜鸟,都是笨鸟先飞,原创 2015-10-27 21:21:04 · 400 阅读 · 0 评论 -
hdu 2500 做一个正气的杭电人
做一个正气的杭电人Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9367 Accepted Submission(s): 7469Problem Description做人要有一身正气,杭电学子都应该如此。比原创 2015-10-26 13:55:21 · 773 阅读 · 0 评论 -
hdu 3605 Escape(最大流+状态压缩 or 二分图多重匹配)
EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 7789 Accepted Submission(s): 1684Problem Description2012 If this is the end原创 2015-10-23 13:19:31 · 485 阅读 · 0 评论 -
hdu 3468 Treasure Hunting(最短路点判断,建图,最大流)
Treasure HuntingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1657 Accepted Submission(s): 441Problem DescriptionDo you like t原创 2015-10-11 11:26:52 · 535 阅读 · 0 评论 -
nyoj 99 单词拼接(欧拉图 )
单词拼接时间限制:3000 ms | 内存限制:65535 KB难度:5描述给你一些单词,请你判断能否把它们首尾串起来串成一串。前一个单词的结尾应该与下一个单词的道字母相同。如alohadogarachnidgophertigerrat 可以拼接成:aloha.ara原创 2015-10-08 19:13:32 · 736 阅读 · 0 评论 -
nyoj 18 The Triangle(数塔)
The Triangle时间限制:1000 ms | 内存限制:65535 KB难度:4描述73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of原创 2015-09-23 20:08:17 · 472 阅读 · 0 评论 -
nyoj 68 三点顺序
三点顺序时间限制:1000 ms | 内存限制:65535 KB难度:3描述现在给你不共线的三个点A,B,C的坐标,它们一定能组成一个三角形,现在让你判断A,B,C是顺时针给出的还是逆时针给出的?如:图1:顺时针给出图2:逆时针给出 输原创 2015-09-23 10:04:15 · 575 阅读 · 0 评论 -
nyoj 239 月老的难题(匈牙利算法+邻接表)
月老的难题时间限制:1000 ms | 内存限制:65535 KB难度:4描述月老准备给n个女孩与n个男孩牵红线,成就一对对美好的姻缘。现在,由于一些原因,部分男孩与女孩可能结成幸福的一家,部分可能不会结成幸福的家庭。现在已知哪些男孩与哪些女孩如果结婚的话,可以结成幸福的家庭,月老准备促成尽可能多的幸福家庭,请你帮他找出最多可能促成的幸福原创 2015-09-23 09:59:36 · 560 阅读 · 0 评论 -
nyoj 349 Sorting It All Out(拓扑排序度的理解)
Sorting It All Out时间限制:3000 ms | 内存限制:65535 KB难度:3描述An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements原创 2015-09-19 19:18:40 · 2442 阅读 · 0 评论 -
nyoj 38 布线问题(kruskal 最小生成树)
布线问题时间限制:1000 ms | 内存限制:65535 KB难度:4描述南阳理工学院要进行用电线路改造,现在校长要求设计师设计出一种布线方式,该布线方式需要满足以下条件:1、把所有的楼都供上电。2、所用电线花费最少输入第一行是一个整数n表示有n组测试数据。(n每组测试数据的第一行是两个整数v,e.v表示学校里楼的总个数(v随后原创 2015-09-13 19:28:11 · 440 阅读 · 0 评论 -
nyoj 170 网络的可靠性
网络的可靠性时间限制:3000 ms | 内存限制:65535 KB难度:3描述A公司是全球依靠的互联网解决方案提供商,也是2010年世博会的高级赞助商。它将提供先进的网络协作技术,展示其”智能+互联“的生活概念,同时为参观者提供高品质的个人体验和互动,以”信息通信,尽情城市梦想”为主题贯穿。借助奇幻的剧场大屏幕和特效,展现信息通信技术的应用前景,通过生原创 2015-09-12 18:23:06 · 342 阅读 · 0 评论 -
nyoj 323 Drainage Ditches(dinic模板)
Drainage Ditches时间限制:1000 ms | 内存限制:65535 KB难度:4描述Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered原创 2015-09-11 11:26:01 · 471 阅读 · 0 评论 -
nyoj 115 城市平乱(dijkstra 终点当起点)
城市平乱时间限制:1000 ms | 内存限制:65535 KB难度:4描述南将军统领着N个部队,这N个部队分别驻扎在N个不同的城市。他在用这N个部队维护着M个城市的治安,这M个城市分别编号从1到M。现在,小工军师告诉南将军,第K号城市发生了暴乱,南将军从各个部队都派遣了一个分队沿最近路去往暴乱城市平乱。现在已知在任意两个城市之间原创 2015-09-10 23:12:22 · 595 阅读 · 0 评论 -
nyoj 120 校园网络(入度出度判断)
校园网络时间限制:3000 ms | 内存限制:65535 KB难度:5描述南阳理工学院共有M个系,分别编号1~M,其中各个系之间达成有一定的协议,如果某系有新软件可用时,该系将允许一些其它的系复制并使用该软件。但该允许关系是单向的,即:A系允许B系使用A的软件时,B未必一定允许A使用B的软件。现在,请你写一个程序,根据各个系之间达成的协议情况,原创 2015-09-09 13:20:10 · 688 阅读 · 0 评论 -
nyoj 20 吝啬的国度(邻接表+bfs)
吝啬的国度时间限制:1000 ms | 内存限制:65535 KB难度:3描述在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,他有张该国地图,他想知道如果自己要去参观第T号城市,必须经过的前一个城市是几号城市(假设你不走重复的路)。输入第一行输入一个整数M表示测试数据共有M(1每组测试数据原创 2015-09-08 18:56:21 · 540 阅读 · 0 评论 -
hdu 1385 Minimum Transport Cost(floyd && 记录路径)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8794 Accepted Submission(s): 2311Problem DescriptionThese a原创 2015-08-21 17:20:05 · 808 阅读 · 0 评论 -
hdu 1248 寒冰王座(暴力)
寒冰王座Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13193 Accepted Submission(s): 6730Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞原创 2015-08-21 17:15:20 · 605 阅读 · 0 评论 -
UVA 4855 Hyper Box
You live in the universe X where all thephysical laws and constants are differentfrom ours. For example all of their objectsare N-dimensional. The living beingsof the universe X want to build原创 2015-08-20 17:45:27 · 902 阅读 · 0 评论 -
UVA 4854 A Digital Satire of Digital Age(模拟)
The government of “Moderdesh” is planning to enter the digital age and so people of different professionand business are proposing different ways to enter that age successfully. The hardware vendors原创 2015-08-20 17:37:13 · 752 阅读 · 0 评论 -
light oj 1094 Farthest Nodes in a Tree(树的直径模板)
1094 - Farthest Nodes in a TreePDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGiven a tree (a connected graph with no cycles), yo原创 2015-08-19 20:45:11 · 802 阅读 · 0 评论 -
poj 1087 A Plug for UNIX(字符串编号建图)
A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14862 Accepted: 5026DescriptionYou are in charge of setting up the press room for the ina原创 2015-08-19 17:32:41 · 742 阅读 · 0 评论 -
spoj 10232 Distinct Primes(打表)
Distinct PrimesArithmancy is Draco Malfoy's favorite subject, but what spoils it for him is that Hermione Granger is in his class, and she is better than him at it. Prime numbers are of mystical im原创 2015-08-19 14:11:07 · 847 阅读 · 0 评论 -
hdu 1596 find the safest road(最长路)
find the safest roadTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9285 Accepted Submission(s): 3287Problem DescriptionXX星球有很多城原创 2015-08-19 14:08:18 · 639 阅读 · 0 评论 -
hdu 2112 HDU Today(dijkstra && 字符串建图 && floyd加map)
HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19484 Accepted Submission(s): 4576Problem Description经过锦囊相助,海东集团终于度过了危机原创 2015-08-17 18:33:11 · 754 阅读 · 0 评论 -
hdu 5131 Song Jiang's rank list(模拟)
Song Jiang's rank listTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 662 Accepted Submission(s): 329Problem Description《Shui H原创 2015-08-16 21:20:45 · 879 阅读 · 0 评论 -
hdu 5137 How Many Maos Does the Guanxi Worth(dijkstra && floyd)
How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 853 Accepted Submission(s): 326Problem Descrip原创 2015-08-16 21:04:48 · 675 阅读 · 0 评论 -
poj 2367 Genealogical tree(拓扑)
Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3685 Accepted: 2453 Special JudgeDescriptionThe system of Martians' blood relations原创 2015-08-14 20:45:47 · 863 阅读 · 0 评论 -
hdu 4324 Triangle LOVE(拓扑判环)
Triangle LOVETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3603 Accepted Submission(s): 1416Problem DescriptionRecently, scient原创 2015-08-14 20:42:32 · 712 阅读 · 0 评论 -
hdu 2883 kebab(时间区间压缩 && dinic)
kebabTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1243 Accepted Submission(s): 516Problem DescriptionAlmost everyone likes keb原创 2015-08-14 17:44:33 · 772 阅读 · 0 评论 -
hdu 2515 Yanghee 的算术
Yanghee 的算术Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 634 Accepted Submission(s): 442Problem DescriptionYanghee 是一个小学生。他的数学老原创 2015-08-13 21:34:47 · 698 阅读 · 0 评论 -
hdu 2524 矩形A + B (公式)
矩形A + BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5271 Accepted Submission(s): 4096Problem Description给你一个高为n ,宽为m列的网格,计算出这个原创 2015-08-13 20:45:43 · 521 阅读 · 0 评论 -
hdu 5099 Comparison of Android versions
Comparison of Android versionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1175 Accepted Submission(s): 472Problem Description原创 2015-08-13 20:20:17 · 752 阅读 · 0 评论 -
hdu 5090 Game with Pearls(最大匹配)
Game with PearlsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1914 Accepted Submission(s): 671Problem DescriptionTom and Jerry原创 2015-08-13 16:46:02 · 721 阅读 · 0 评论 -
hdu 5093 Battle ships(二分图匹配)
Battle shipsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 893 Accepted Submission(s): 314Problem DescriptionDear contestant, no原创 2015-08-13 16:20:08 · 892 阅读 · 0 评论 -
hdu 5095 Linearization of the kernel functions in SVM(模拟)
Linearization of the kernel functions in SVMTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2242 Accepted Submission(s): 601Problem原创 2015-08-13 15:55:33 · 659 阅读 · 0 评论 -
hdu 2732 && poj 2711 Leapin' Lizards(dinic && 拆点建图经典)
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1651 Accepted Submission(s): 678Problem DescriptionYour platoon of原创 2015-08-12 19:58:45 · 852 阅读 · 0 评论