Lake CountingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 20003Accepted: 10063DescriptionDue to recent rains, water has pooled in various ...
分类：
其他好文 时间：
2014-07-27 23:32:29
阅读次数：
256
贪心+并查集fighting~~~~~！！ 1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 #define maxn 300 7 #define INF 0x3fffffff 8 int par[maxn]; ...
分类：
其他好文 时间：
2014-07-27 21:36:35
阅读次数：
182
Description
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 by water for awhile and takes quite a long time to r...
分类：
其他好文 时间：
2014-07-27 11:17:12
阅读次数：
255
题目：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 e....
分类：
编程语言 时间：
2014-07-27 11:04:52
阅读次数：
278
Description
The Eastowner city is perpetually haunted with water supply shortages, so in order to remedy this problem a new water-pipe has been built. Builders started the pipe from both ends simul...
分类：
其他好文 时间：
2014-07-26 17:18:12
阅读次数：
313
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类：
其他好文 时间：
2014-07-26 14:30:11
阅读次数：
156
1557. Can you answer these queries IIProblem code: GSS2Being a completist and a simplist, kid Yang Zhe cannot solve but get Wrong Answer from most of....
分类：
其他好文 时间：
2014-07-26 05:44:27
阅读次数：
377
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-07-26 01:23:26
阅读次数：
229
一个int占多少个字节?这个问题我们往往得到的答案是4.可是int究竟占多少个字节,却跟你的机器环境有关.As you can see, the typical data type sizes match the ILP32LL model, which is what most compilers...
分类：
其他好文 时间：
2014-07-25 19:05:41
阅读次数：
272
Just Pour the WaterTime Limit: 2 Seconds Memory Limit: 65536 KBShirly is a very clever girl. Now she has two containers (A and B), each with some wat....
分类：
其他好文 时间：
2014-07-25 18:58:22
阅读次数：
374
