Description
Hackerland is a happy democratic country with m×n cities, arranged in a rectangular
m by n grid and connected by
m roads in the east-west direction and
n roads in the north-south di...
分类：
其他好文 时间：
2014-08-20 22:45:43
阅读次数：
425
1621: [Usaco2008 Open]Roads Around The Farm分岔路口Time Limit:5 SecMemory Limit:64 MBSubmit:521Solved:380[Submit][Status]Description约翰的N(1≤N≤1,000,000,000...
分类：
其他好文 时间：
2014-08-20 17:51:42
阅读次数：
231
Romantic Value
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Farmer John is a diligent man. He spent a lot of time building roads between his farms. From his point of view, every ro...
分类：
其他好文 时间：
2014-08-19 10:58:44
阅读次数：
228
hdu 1102 Constructing Roads(最小生成树)...
分类：
其他好文 时间：
2014-08-19 09:24:03
阅读次数：
164
Building RoadsTime Limit:1000MSMemory Limit:65536KTotal Submissions:9255Accepted:2669DescriptionFarmer John had just acquired several new farms! He wa...
分类：
其他好文 时间：
2014-08-17 15:34:22
阅读次数：
298
to get the ans of how many roads at most that can be built between two line without intersection of roads,we need sort the input sequence at ont edge ...
分类：
其他好文 时间：
2014-08-16 17:01:30
阅读次数：
288
发现这个说的比较通俗：假设存在一个序列d[1..9] = 2 1 5 3 6 4 8 9 7，可以看出来它的LIS长度为5。下面一步一步试着找出它。我们定义一个序列B，然后令 i = 1 to 9 逐个考察这个序列。此外，我们用一个变量Len来记录现在最长算到多少了首先，把d[1]有序地放到B里，令...
分类：
其他好文 时间：
2014-08-15 20:50:19
阅读次数：
364
本题是LIS题解。主要是理解他的题意。他的题意都好像比较隐晦，比如每个poor city和rich city一定是需要对应起来的，比如poor city和rich city并不是按顺序给出的。
其实是可以把数列按照poor city排序，然后求rich city城市号的最大递增子序列。
不过这里不用排序，利用hash的思想直接对应起来就可以了。
然后就是本题是卡DP的O(n*n)的解法的，这...
分类：
其他好文 时间：
2014-08-15 17:55:49
阅读次数：
211
Questa societ che aveva iniziato piccola ben presto tr . Additionally, when constructing scaffolding, netting and/or guard rails may be used for extra...
分类：
其他好文 时间：
2014-08-14 13:49:58
阅读次数：
329
Problem Description
JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.
Half of these cities are rich in resource (we call them ri...
分类：
其他好文 时间：
2014-08-14 01:37:07
阅读次数：
237
