1. 设 $A,B$ 为 $n$ 阶方阵, $\rank(A)
分类：
其他好文 时间：
2014-07-22 22:58:14
阅读次数：
290
This is the same asSPOJ #453. The best way to understand DP1A code:class Solution {public: int minimumTotal(vector > &triangle) { fo...
分类：
其他好文 时间：
2014-07-18 21:19:47
阅读次数：
234
The Jordan 5 3Lab5 Metallic Silver returns inside a mind-turning new iteration for that Spring/Summer time 2014 season. Getting together the very best...
分类：
其他好文 时间：
2014-07-18 15:25:12
阅读次数：
231
最好牛线(Best Cow Line) 代码(C)本文地址: http://blog.csdn.net/caroline_wendy题目: 给定长度为N的字符串S, 要构造一个长度为N的字符串T. 反复进行如下任意操作.从S的头部删除一个字符, 放入T的尾部;从S的尾部删除一个字符, 放入T的尾部;目标是要构造字典序尽可能小的字符串T.使用贪心算法, 不断选取S首尾最小的字符, 放入T, 如果相等...
分类：
其他好文 时间：
2014-07-17 20:28:41
阅读次数：
225
[LeetCode]Best Time to Buy and Sell Stock II...
分类：
其他好文 时间：
2014-07-16 17:32:35
阅读次数：
181
Description
Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best s...
分类：
其他好文 时间：
2014-07-16 14:29:06
阅读次数：
195
ay 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 at...
分类：
其他好文 时间：
2014-07-13 23:22:16
阅读次数：
294
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note:
You ma...
分类：
其他好文 时间：
2014-07-13 13:55:14
阅读次数：
305
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),...
分类：
其他好文 时间：
2014-07-12 17:34:34
阅读次数：
170
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on...
分类：
其他好文 时间：
2014-07-12 16:31:50
阅读次数：
192
