方程式Time Limit:1000MSMemory
Limit:65535KBSubmissions:2312Accepted:580DescriptionConsider equations having
the following form: a*x1*x1 + b*x2*x2 + c*x3*...
分类：
其他好文 时间：
2014-05-05 21:36:51
阅读次数：
222
火柴棍Time Limit:1000MSMemory
Limit:65535KBSubmissions:82Accepted:21Description火柴棍可以拼成10进制的数字，如图所示：现在，gogo给你个n个火柴棍，要求你输出最小能拼成的数字和最大能拼成的数字。Input第一行输入一个整数T...
分类：
其他好文 时间：
2014-05-05 21:32:02
阅读次数：
365
If you have installed YouTrack from EXE
Distribution, then the best way to change the database location is by specifying
it via JVM property.Stop curr...
分类：
数据库 时间：
2014-05-03 23:30:08
阅读次数：
505
Say you have an array for which theithelement
is the price of a given stock on dayi.Design an algorithm to find the maximum
profit. You may complete a...
分类：
其他好文 时间：
2014-05-03 23:21:20
阅读次数：
292
采药Time Limit:1000MSMemory
Limit:65535KBSubmissions:380Accepted:113Description辰辰是个天资聪颖的孩子，他的梦想是成为世界上最伟大的医师。为此，他想拜附近最有威望的医师为师。医师为了判断他的资质，给他出了一个难题。医师把他带到...
分类：
其他好文 时间：
2014-05-03 23:04:07
阅读次数：
351
A Star not a Tree?
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 3272
Accepted: 1664
Description
Luke wants to upgrade his home computer network from 10mbs...
分类：
其他好文 时间：
2014-05-03 21:31:49
阅读次数：
417
Sliding Window
Time Limit: 12000MS
Memory Limit: 65536K
Total Submissions: 36315
Accepted: 10756
Case Time Limit: 5000MS
Description
An array of size n ≤ 106 is gi...
Valera wanted to prepare a Codesecrof round. He's already got one problem and he wants to set a time limit (TL) on it.
Valera has written n correct solutions. For each correct solution, he knows it...
分类：
其他好文 时间：
2014-05-03 16:53:51
阅读次数：
364
Max Sum of Max-K-sub-sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5673 Accepted Submission(s): 2049
Problem Description...
分类：
其他好文 时间：
2014-05-03 16:30:10
阅读次数：
412
点击打开链接
Party All the Time
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2961 Accepted Submission(s): 939
Problem Description...
分类：
其他好文 时间：
2014-05-03 15:30:56
阅读次数：
374
