动态规划基础学习（一）线性

    动态规划一直是个大问题。

   动态规划(dynamic programming)是运筹学的一个分支，是求解决策过程(decision process)最优化的数学方法（俗称DP）。

   动态规划一般可分为线性动规，区域动规，树形动规，背包动规四类。

   1,  线性动规：

                        拦截导弹，合唱队形，挖地雷，建学校，剑客决斗等

   2  区域动规：

                        石子合并， 加分二叉树，统计单词个数，炮兵布阵等

  3  树形动规：

                      贪吃的九头龙，二分查找树，聚会的欢乐，数字三角形等

  4 背包问题：

                     01背包问题，完全背包问题，分组背包问题，二维背包，装箱问题，挤牛奶（同济ACM第1132题）等

 

                                                                                                                                                                                                              以上来自百度百科

一个简单的例子来阐述DP的基本思路和特点

                                                第一弹：数字三角形

描述:给定一个由n行数字组成的数字三角形如下图所示。试设计一个算法，计算出从三角形的顶至底的一条路径，使该路径经过的数字总和最大。

思路：从最下面的一个开始查找最优解，不断更新，输出d（1，1）。

//数字三角形
#include <iostream>
using namespace std;
const int M=100;
int n;
int a[M][M];
int func()
{
  int i,j;
 for(i=n-1;i>=1;i--)//从底部开始查找
  for(j=1;j<=i;j++)
  {
   if(a[i+1][j]>a[i+1][j+1]) 
        a[i][j]+=a[i+1][j];
   else a[i][j]+=a[i+1][j+1];//这两行就是DP的核心：状态转移方程
  } 
  return a[1][1];
}
int main()
{
 int i,j,max;
  cin>>n;
 for(i=1;i<=n;i++)
  for(j=1;j<=i;j++)
   cin>>a[i][j];
   max=func();
  cout<<max<<endl;
  return 0;
}

样例输入输出可见出算法的规律

                                                                            

BUY LOW, BUY LOWER

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 8200		Accepted: 2852

Description

The advice to "buy low" is half the formula to success in the bovine stock market.To be considered a great investor you must also follow this problems' advice: 

                    "Buy low; buy lower"

Each time you buy a stock, you must purchase it at a lower price than the previous time you bought it. The more times you buy at a lower price than before, the better! Your goal is to see how many times you can continue purchasing at ever lower prices. 

You will be given the daily selling prices of a stock (positive 16-bit integers) over a period of time. You can choose to buy stock on any of the days. Each time you choose to buy, the price must be strictly lower than the previous time you bought stock. Write a program which identifies which days you should buy stock in order to maximize the number of times you buy. 

Here is a list of stock prices: 

 Day   1  2  3  4  5  6  7  8  9 10 11 12

Price 68 69 54 64 68 64 70 67 78 62 98 87

The best investor (by this problem, anyway) can buy at most four times if each purchase is lower then the previous purchase. One four day sequence (there might be others) of acceptable buys is: 

Day    2  5  6 10

Price 69 68 64 62

Input

* Line 1: N (1 <= N <= 5000), the number of days for which stock prices are given 

* Lines 2..etc: A series of N space-separated integers, ten per line except the final line which might have fewer integers. 

Output

Two integers on a single line: 
* The length of the longest sequence of decreasing prices 
* The number of sequences that have this length (guaranteed to fit in 31 bits) 

In counting the number of solutions, two potential solutions are considered the same (and would only count as one solution) if they repeat the same string of decreasing prices, that is, if they "look the same" when the successive prices are compared. Thus, two different sequence of "buy" days could produce the same string of decreasing prices and be counted as only a single solution. 

Sample Input