1.Problem DescriptionGiven a sequence
a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a
sub-sequence. For example, given (6,-1,5,4,-...
分类：
其他好文 时间：
2014-06-02 17:36:53
阅读次数：
234
My original thought was to calculate all the
possible transactions by using nested loop. But got time limit excess error.I
knew it can be done in O(n)...
分类：
其他好文 时间：
2014-05-29 20:44:37
阅读次数：
271
Sepearable 2D EDT, going to extend to 3D in
order to calculate the Signed Distance Function(Field)Cost 0.75s to generate the
SDF at 768^2
分类：
其他好文 时间：
2014-05-28 03:13:14
阅读次数：
276
Calculate the FunctionTime Limit:2000MSMemory
Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusAppoint
description:DescriptionYou are given a list ...
分类：
其他好文 时间：
2014-05-27 18:03:16
阅读次数：
394
Problem Description
In a 2_D plane, there is a point strictly in a regular polygon with N sides. If you are given the distances between it and N vertexes of the regular polygon, can you calculate t...
分类：
其他好文 时间：
2014-05-26 03:50:40
阅读次数：
252
DescriptionYour task is to calculate the sum of
some integers.InputInput contains an integer N in the first line, and then N
lines follow. Each line s...
分类：
其他好文 时间：
2014-05-23 06:41:47
阅读次数：
298
就拿杭电OJ上的第1003题开始吧，这题比原书要复杂一些。
Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum...
分类：
其他好文 时间：
2014-05-22 07:07:27
阅读次数：
322
Another way to calculate sum of 1 to N.
分类：
其他好文 时间：
2014-05-22 03:33:00
阅读次数：
201
Dynamic programming and meta-programming to
calculate Fib arrays.
分类：
其他好文 时间：
2014-05-22 01:42:39
阅读次数：
341
