Linking Containers Together
In the Using Docker section we touched on connecting to a service running inside a Docker container via a network port. This is one of
the ways that you can interact w...
分类：
其他好文 时间：
2014-08-17 11:46:32
阅读次数：
245
Three FamiliesThree families share a garden. They usually clean the garden together at the end of each week, but last week, family C was on holiday, s...
分类：
其他好文 时间：
2014-08-17 02:26:01
阅读次数：
264
Description
The cows are so very silly about their dinner partners. They have organized themselves into three groups (conveniently numbered 1, 2, and 3) that insist upon dining together. The troubl...
分类：
其他好文 时间：
2014-08-15 17:56:49
阅读次数：
205
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). Find two lines, which together with x-axis forms a container, suc...
分类：
其他好文 时间：
2014-08-15 10:47:38
阅读次数：
255
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
上帝和每个人开的玩笑都不一样[问题描述]Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first...
分类：
其他好文 时间：
2014-08-13 22:15:17
阅读次数：
221
1609: [Usaco2008 Feb]Eating Together麻烦的聚餐Time Limit:10 SecMemory Limit:64 MBSubmit:938Solved:562[Submit][Status]Description为了避免餐厅过分拥挤，FJ要求奶牛们分3批就餐。每天晚...
分类：
其他好文 时间：
2014-08-12 09:00:13
阅读次数：
260
#ExampleMySQLconfigfileformediumsystems.##Thisisforasystemwithlittlememory(32M-64M)whereMySQLplays#animportantpart,orsystemsupto128MwhereMySQLisusedtogetherwith#otherprograms(suchasawebserver)##MySQLprogramslookforoptionfilesinasetof#Thefollowingoptionswill..
分类：
其他好文 时间：
2014-08-12 03:41:04
阅读次数：
196
DescriptionVaibhav Sir and Saikat Sir, after completing their graduation, got a job together at a store.Their boss at the store was Sidharth Sir, who ...
分类：
其他好文 时间：
2014-08-11 08:22:01
阅读次数：
270
本题就是一题LIS（最长递增子序列）的问题。本题要求求最长递增子序列和最长递减子序列。
dp的解法是O(n*n)，这个应该大家都知道，不过本题应该超时了。
因为有O(nlgn）的解法。
但是由于本题的数据特殊性，故此本题可以利用这个特殊性加速到O(n)的解法，其中的底层思想是counting sort分段的思想。就是如果你不会counting sort的话，就很难想出这种优化的算法了。
...
分类：
其他好文 时间：
2014-08-09 23:18:49
阅读次数：
393
