码迷,mamicode.com
首页 >  
搜索关键字:travel    ( 620个结果
Leetcode:Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to ...
分类:其他好文   时间:2015-02-05 16:27:38    阅读次数:142
leetcode——Gas Station
题目: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from statio...
分类:其他好文   时间:2015-02-04 14:44:57    阅读次数:166
Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to ...
分类:其他好文   时间:2015-02-04 14:41:47    阅读次数:134
【BZOJ 1576】 [Usaco2009 Jan]安全路经Travel
最短路径树+并查集/树链剖分~ 详细题解~...
分类:其他好文   时间:2015-02-04 09:28:37    阅读次数:242
poj 2828 Buy Tickets 万能的线段树大法。
Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue… The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he had to travel by tra...
分类:其他好文   时间:2015-02-03 09:37:13    阅读次数:222
HDU 4612 Warm up(边双联通求树的直径)
Problem Description   N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel between any two planets through these channels.   If we ...
分类:移动开发   时间:2015-01-29 21:11:36    阅读次数:248
[C++]LeetCode: 119 Gas Station
题目: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from statio...
分类:编程语言   时间:2015-01-23 23:12:37    阅读次数:464
Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to ...
分类:其他好文   时间:2015-01-23 23:09:02    阅读次数:399
bzoj 1576: [Usaco2009 Jan]安全路经Travel 树链剖分
1576: [Usaco2009 Jan]安全路经TravelTime Limit:10 SecMemory Limit:64 MBSubmit:665Solved:227[Submit][Status]DescriptionInput* 第一行: 两个空格分开的数, N和M* 第2..M+1行: ...
分类:其他好文   时间:2015-01-21 21:45:02    阅读次数:236
620条   上一页 1 ... 40 41 42 43 44 ... 62 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!