就拿杭电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
链接看此题前先看一下matrix67大神写的关于十个矩阵的题目中的一个，如下：经典题目8
给定一个有向图，问从A点恰好走k步（允许重复经过边）到达B点的方案数mod
p的值把给定的图转为邻接矩阵，即A(i,j)=1当且仅当存在一条边i->j。令C=A*A，那么C(i,j)=ΣA(i,k)*A(k,j...
分类：
其他好文 时间：
2014-05-20 02:46:43
阅读次数：
249
题目描述Given a number sequence whose length is n, you
can delete at most k numbers in the sequence.After that you are asked to answer
the maximum length ...
分类：
其他好文 时间：
2014-05-19 22:21:32
阅读次数：
304
Subsequence
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 8128
Accepted: 3141
Description
A sequence of N positive integers (10 < N < 100 000), each of t...
分类：
其他好文 时间：
2014-05-18 15:26:37
阅读次数：
284
Given a string containing just the characters '(', ')', '{', '}', '[' and ']',
determine if the input string is valid.
The brackets must close in the correct order, "()" and "()[]{}" are
all vali...
分类：
其他好文 时间：
2014-05-18 15:11:17
阅读次数：
249
【题目】
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.
【题意】
判断给定的字符串是否是合法的...
分类：
其他好文 时间：
2014-05-18 10:08:11
阅读次数：
327
题目:
Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
Clarification:
What constitutes a word?
A sequence of non-spa...
分类：
其他好文 时间：
2014-05-18 04:12:07
阅读次数：
198
Given an unsorted array of integers, find the
length of the longest consecutive elements sequence.For example,Given[100, 4,
200, 1, 3, 2],The longest ...
分类：
其他好文 时间：
2014-05-18 01:52:45
阅读次数：
317
控制焦点Focus on Control 的取值：Alternative
fragment（denoted “alt”） 与 if…then…else对应Option fragment (denoted “opt”) 与
Switch对应Parallel fragment (denoted “par...
分类：
其他好文 时间：
2014-05-17 22:05:02
阅读次数：
298
Problem DescriptionA number sequence is defined
as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given
A, B, and n, you are t...
分类：
其他好文 时间：
2014-05-16 00:34:50
阅读次数：
354
