c++编程基础
| ·nyist oj 171 聪明的kk (动态规划） (2015-07-20) |
| ·URAL 1748. The Most Complex Number 反素数 (2015-07-20) |
| ·剑指offer面试题31:连续子数组的最大和 (2015-07-20) |
| ·POJ 2983 Is the Information Reliable?（差分约束系统） (2015-07-20) |
| ·POJ训练计划1201_Intervals(差分约束) (2015-07-20) |
| ·POJ 3036 Honeycomb Walk(DP) (2015-07-20) |
| ·hdu-3635 Dragon Balls (2015-07-20) |
| ·HDU 1541 Stars （线段树） (2015-07-20) |
| ·POJ 3159 Candies(差分约束系统) (2015-07-20) |
| ·HDOJ 2829 Lawrence (2015-07-20) |
| ·UVA 11557 - Code Theft (KMP + HASH) (2015-07-20) |
| ·杭电1171 Big Event in HDU（母函数+多重背包解法） (2015-07-20) |
| ·CF 379D NewYearLetter [dp+暴力] (2015-07-20) |
| ·HDU 3315 My Brute(费用流） (2015-07-20) |
| ·UVA 11020 - Efficient Solutions(set) (2015-07-20) |
| ·LeetCode之小孩分糖果 (2015-07-20) |
| ·uva 12130 - Summits(BFS) (2015-07-20) |
| ·POJ 1952 BUY LOW, BUY LOWER DP记录数据 (2015-07-20) |
| ·hdu 4975 最大流及其唯一性判定（有向图环判断算法升级） (2015-07-20) |
| ·uva 12232 - Exclusive-OR(加权并查集) (2015-07-20) |
