
ACM算法题
BadGuy523
这个作者很懒,什么都没留下…
展开
-
简单最短路
A - 最短路 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description 在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗?原创 2015-11-10 22:31:35 · 444 阅读 · 0 评论 -
Sightseeing(最短路与次短路之和)
Sightseeing Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription Tour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus m原创 2015-11-29 13:00:48 · 746 阅读 · 0 评论 -
Buy or Build
H - Buy or Build Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluWorld Wide Networks (WWN) is a leading company that operates large telecommunication networks.WWN would like to setu原创 2015-11-26 16:22:07 · 638 阅读 · 0 评论 -
Slim Span(生成树苗条度)
Slim Span Time Limit: 5000MS Memory Limit: 65536K DescriptionGiven an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), wh原创 2015-11-23 17:06:25 · 727 阅读 · 0 评论 -
THE MATRIX PROBLEM(差分约束)
C - THE MATRIX PROBLEM Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescriptionYou have been given a matrix C N*M, each element E of C N*M is positive and no more than 1000原创 2015-11-23 14:56:46 · 612 阅读 · 0 评论 -
Intervals(差分约束)
B - Intervals Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, …, cn. Write a program that:原创 2015-11-23 12:23:15 · 475 阅读 · 0 评论 -
最小环(floyd)
A - find the mincost route Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription杭州有N个景区,景区之间有一些双向的路来连接,现在8600想找一条旅游路线,这个路线从A点出发并且最后回到A点,假设经过的路线为V1,V2,….VK,V1,那么必须满足K>2,就原创 2015-11-22 20:43:43 · 498 阅读 · 0 评论 -
畅通工程(最小生成树模板题)
E - 还是畅通工程 Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为原创 2015-11-23 12:40:25 · 400 阅读 · 0 评论 -
Constructing Roads(最小生成树)
D - Constructing Roads Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such th原创 2015-11-23 12:36:27 · 418 阅读 · 0 评论 -
Fibonacci Tree
F - Fibonacci Tree Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on原创 2015-11-23 12:52:07 · 404 阅读 · 0 评论 -
昂贵的聘礼
F - 昂贵的聘礼 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:”嗯,如果你能原创 2015-11-10 23:54:51 · 340 阅读 · 0 评论 -
XYZZY(spfa判环)
B - XYZZY Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number原创 2015-11-10 23:17:44 · 907 阅读 · 0 评论 -
Max Sum(简单的最大子序列和的问题)
A - Max SumTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate t原创 2015-09-17 22:14:31 · 1040 阅读 · 0 评论 -
Sightseeing trip(求最小环,记录路径)
Sightseeing trip Time Limit: 1000MS Memory Limit: 65536K Special Judge DescriptionThere is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many原创 2015-12-09 17:00:39 · 956 阅读 · 0 评论