poj 1695 Magazine Delivery

题目链接：http://poj.org/problem?id=1695

题目思路：定义dp[i][j][k]为三辆车分别在i,j,k点处的最小时间且i<=j<=k;

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<queue>
#include<algorithm>
#include<vector>
#include<stack>
#include<list>
#include<iostream>
#include<map>
using namespace std;
#define inf 0x3f3f3f3f
#define Max 110
int max(int a,int b)
{
	return a>b?a:b;
}
int min(int a,int b)
{
    if(a==-1)
        return b;
	return a<b?a:b;
}
int t;
int dp[33][33][33];
int mp[33][33];
int main()
{
    int n,i,j,k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=1;i<n;i++)
            for(j=i+1;j<=n;j++)
                scanf("%d",&mp[i][j]);
        memset(dp,-1,sizeof(dp));
        dp[1][1][1]=0;
        for(i=1;i<n;i++)
            for(j=i;j<n;j++)
                for(k=j;k<n;k++)
                {
                    if(dp[i][j][k]==-1)
                        continue;
                    dp[j][k][k+1]=min(dp[j][k][k+1],dp[i][j][k]+mp[i][k+1]);
                    dp[i][k][k+1]=min(dp[i][k][k+1],dp[i][j][k]+mp[j][k+1]);
                    dp[i][j][k+1]=min(dp[i][j][k+1],dp[i][j][k]+mp[k][k+1]);
                }
       int  ans=inf;
        for(i=1;i<n;i++)
            for(j=1;j<n;j++)
                ans=min(dp[i][j][n],ans);
        printf("%d\n",ans);
    }
}