<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[jackfong_123的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/jackfong_123</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jackfong_123]]></copyright><item><title><![CDATA[Light oj1422 Halloween Costumes 区间DP]]></title><link>https://blog.youkuaiyun.com/jackfong_123/article/details/51002512</link><guid>https://blog.youkuaiyun.com/jackfong_123/article/details/51002512</guid><author>jackfong_123</author><pubDate>Tue, 29 Mar 2016 00:33:28 +0800</pubDate><description><![CDATA[第一次发博客，纪念今天学会的区间dp
题目链接：点击打开链接
 
#include   
#include  
#include
#include
#include
using namespace std;
int n;
int a[102];
int dp[102][102];

//状态方程如下：
//dp[i][j]=dp[i+1][j];
//dp[i][j]=min(dp[i][j]]]></description><category></category></item></channel></rss>