CodeForces - 158E Phone Talks(dp)

可能以后补题会少一点了.
这题虽然知道是dp,但是还是想不出好的dp状态,看了题解后发现,我以前想dp,总是想着答案直接就在dp数组里面,这样有时就很难处理,这题就是这样,处理出dp之后,还要根据每一组的时间开始来剪去,计算最长时间间隔.
这题我也不是很懂,但是感觉是一个很好的题目,写个博客记一下把.

/*  xzppp  */
#include <bits/stdc++.h>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson MAXN,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
typedef long long  LL;
typedef unsigned long long ULL;
const int MAXN = 4000+17;
const int MAXM = 100000+17;
const int  INF = 0x7fffffff;
const int  MOD = 1e9+7;
struct call
{
    int t,d;
}all[MAXN];
int dp[MAXN][MAXN];
int main()
{
    //FFF
    int n,k;
    cin>>n>>k;
    for (int i = 1; i <= n; ++i)
        scanf("%d%d",&all[i].t,&all[i].d);
    dp[1][0] = all[1].t+all[1].d-1;
    dp[1][1] = 0;
    all[n+1].t = 86401;
    dp[0][0] = dp[0][1] = 0;
    for (int i = 2; i <= n ; ++i)
    {
        dp[i][0] = max(dp[i-1][0],all[i].t-1)+all[i].d;
        for (int j = 1; j <= min(i,k) ; ++j)
            dp[i][j] = min(max(dp[i-1][j],all[i].t-1)+all[i].d,dp[i-1][j-1]);
    }
    int ans = 0;
    for (int i = 1; i <= n+1; ++i)
        ans = max(all[i].t-dp[i-1][min(i,k)]-1,ans);
    cout<<ans<<endl;
}