https://www.luogu.org/problem/show?pid=1359
挺简单的一道区间DP,注意半矩阵的读入
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define ms(i,j) memset(i,j, sizeof i);
/* NOIP2016倒计时,RP++
Luogu: P1359 租用游艇
设f[i]为到达第i个出租站的最小租用费用
状态转移方程: f[i] = min{f[j]+r[j][i]}
答案即为f[n]
*/
using namespace std;
int r[205][205];
int f[205];
int n;
int main()
{
scanf("%d", &n); ms(f, 0); ms(r,0);
for (int i=1;i<n;i++)//输入r数组
{
for (int j=i+1;j<=n;j++)
{
scanf("%d", &r[i][j]);
}
}
for (int i=1;i<=n;i++)
{
f[i] = i==1 ? 0 : 100000000;
for (int j=1;j<=i;j++)
{
f[i] = min(f[i], f[j]+r[j][i]);
}
}
printf("%d\n", f[n]);
return 0;
}