Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complet...
分类：
其他好文 时间：
2014-08-14 23:19:46
阅读次数：
240
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complet...
分类：
其他好文 时间：
2014-08-14 23:05:56
阅读次数：
165
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction ...
分类：
其他好文 时间：
2014-08-14 20:30:19
阅读次数：
197
Problem Description
One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city...
分类：
其他好文 时间：
2014-08-14 16:51:58
阅读次数：
219
Sunny and Johnny together have M dollars which they intend to use at the ice cream parlour. Among N flavors available, they have to choose two distinc...
分类：
其他好文 时间：
2014-08-14 16:38:58
阅读次数：
317
1.Dutch courage 因为英语与荷兰之间的恩恩怨怨，积重难反，有渊源极深，而荷兰被称为“海盗之国”，海盗是做事鲁莽的，所以就用这个词语来表示“酒后之勇”。2.have a hollow leg 千杯不醉，喝酒海量Eg.The best man has a hollow leg. He dr...
分类：
其他好文 时间：
2014-08-14 13:32:58
阅读次数：
218
D -Problem DTime Limit:1000MSMemory Limit:131072KB64bit IO Format:%lld & %lluSubmitStatusDescriptionWe choose an integer K (K > 0). Then we generate N...
分类：
其他好文 时间：
2014-08-14 13:20:38
阅读次数：
249
Choose the best routeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7062Accepted Submission(s): 2...
分类：
其他好文 时间：
2014-08-14 13:16:58
阅读次数：
257
Choose the best routeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7062Accepted Submission(s): 2...
分类：
其他好文 时间：
2014-08-14 13:11:38
阅读次数：
244
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7061 Accepted Submission(s): 2300
Problem Description
One ...
分类：
其他好文 时间：
2014-08-13 22:34:27
阅读次数：
312
