Who's in the Middle
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 31015
Accepted: 17991
Description
FJ is surveying his herd to find the most average c...
分类：
其他好文 时间：
2014-07-08 19:43:07
阅读次数：
164
字典树
看题库上说这是字典树，不过被我水过去了。
题意是说用对应的字典，翻译出火星文。
each line will contain at most 3000 characters.
看到这句话我就安心了。Time Limit: 10000/5000 MS (Java/Others)
果断用map 来水了。还真AC了。3296MS 。本来是想巩固一下字典树的，不过……。
...
分类：
其他好文 时间：
2014-07-08 14:42:44
阅读次数：
173
Given n non-negative integers a1, a2,
..., an, where each represents a point at coordinate (i, ai). n vertical
lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
0). Fin...
分类：
其他好文 时间：
2014-07-08 14:21:56
阅读次数：
190
Who's in the Middle
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 31149
Accepted: 18073
Description
FJ is surveying his herd to find the most average cow...
分类：
其他好文 时间：
2014-07-08 13:30:10
阅读次数：
144
生成器>>> def func1():... yield 0... yield 1... >>> a=func1()>>> a.next()0>>> a.next()1>>> a.next()Traceback (most recent call last): File "", l...
分类：
编程语言 时间：
2014-07-06 20:07:34
阅读次数：
251
Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ...
分类：
其他好文 时间：
2014-07-06 17:44:30
阅读次数：
181
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at...
分类：
其他好文 时间：
2014-07-06 16:11:35
阅读次数：
170
There are a bunch of different methods you can use to back up your MongoDB data, but if you want to avoid downtime and/or potential
performance degradation, the most common advice seems to be that y...
分类：
数据库 时间：
2014-07-06 09:26:04
阅读次数：
437
For the exercises in this chapter we need a list of English words. There are lots of word lists available on the Web, but the most suitable for our pu...
分类：
其他好文 时间：
2014-07-05 22:45:55
阅读次数：
545
题目
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 (ie, buy one and sell one share of the...
分类：
其他好文 时间：
2014-07-03 17:51:01
阅读次数：
235
