打开SQL，提示“SQL Prompt has been disabled due to an error with the registration of a required DLL - TextMgrP.dll. To resolve the error, repair SQL Server ...
分类：
数据库 时间：
2014-08-06 14:19:41
阅读次数：
447
Paths on the tree
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 297 Accepted Submission(s): 93
Problem Description
bobo has a tr...
分类：
其他好文 时间：
2014-08-06 11:52:11
阅读次数：
284
Count on the path
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 92 Accepted Submission(s): 10
Problem Description
bobo has a tre...
分类：
其他好文 时间：
2014-08-06 11:51:59
阅读次数：
232
启动Apache是443端口被占用，报The requested operation has failed错。
分类：
Windows程序 时间：
2014-08-06 04:09:00
阅读次数：
7386
Git，开源中国以及GitHub所使用的系统，Is A一个分布式版本控制系统Be Used to为团队合作写代码提供方便的管理系统。几乎满足你所有关于合作写代码的幻想。Has本地端：工作区、版本库 （版本库还含有一个暂存区）远程仓库：版本库（用来储存版本库的服务器）How To InstallLin...
分类：
其他好文 时间：
2014-08-06 01:27:40
阅读次数：
324
Inversion
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 197 Accepted Submission(s): 82
Problem Description
bobo has a sequen...
分类：
其他好文 时间：
2014-08-05 22:46:00
阅读次数：
251
Problem Description
bobo has a sequence a1,a2,…,an. He is allowed to swap two
adjacent numbers for no more than k times.
Find the minimum number of inversions after his swaps.
Note: The number...
分类：
其他好文 时间：
2014-08-05 22:44:03
阅读次数：
248
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the contiguous subarray [4,?1,2,1] ha...
分类：
其他好文 时间：
2014-08-05 22:37:50
阅读次数：
188
1023. ButtonsTime limit: 2.0 secondMemory limit: 64 MBBackgroundAs you surely already know, Yekaterinburg has gotten its right to hold The Summer Olym...
分类：
其他好文 时间：
2014-08-05 22:17:20
阅读次数：
229
Bad CowtractorsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10194Accepted:4333DescriptionBessie has been hired to build a cheap internet netw...
分类：
其他好文 时间：
2014-08-05 22:15:30
阅读次数：
327
