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
What will you do when you gather together with your friends in your leisure time? Sitting around and chatting with each other? Doing sports? Or watchi...
分类：
其他好文 时间：
2014-08-06 14:33:41
阅读次数：
236
Problem Description
Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 grid. Now you want to ...
分类：
其他好文 时间：
2014-08-06 01:57:00
阅读次数：
248
Problem DescriptionAlice and Bob are playing together. Alice is crazy about art and she has visited many museums around the world. She has a good memo...
interface Fruit { void eat(); } class Apple implements Fruit { public void eat() { System.out.println("I am eating apple."); } } class Orange implemen...
分类：
编程语言 时间：
2014-08-04 13:28:37
阅读次数：
229
1、从官网下载源码
2、编辑一个config.h：
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.in by autoheader. */
/* Define if you want to use libfaad together wi...
分类：
移动开发 时间：
2014-08-03 18:09:55
阅读次数：
414
Color
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 7630
Accepted: 2507
Description
Beads of N colors are connected together into a circular necklace of ...
分类：
其他好文 时间：
2014-07-31 00:10:35
阅读次数：
330
