P1359 租用游艇(最短路 or dp)

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)


int n;
int dis[205][205];
int dp[MAXN];
int main() {
	memset(dp, INF, sizeof(dp));
	scanf("%d", &n);
	for (int i = 1; i <= n - 1; i++) {
		for (int j = i + 1; j <= n; j++) {
			scanf("%d", &dis[i][j]);
		}
	}
	dp[1] = 0;
	for (int i = 1; i <= n - 1; i++) {
		for (int j = i + 1; j <= n; j++) {
			dp[j] = min(dp[j], dp[i] + dis[i][j]);
		}
	}
	printf("%d", dp[n]);
	return 0;
}


#if 0
int n;
int dis[205][205];
int main() {
	memset(dis, INF, sizeof(dis));
	scanf("%d", &n);
	for (int i = 1; i <= n - 1; i++) {
		for (int j = i; j <= n - 1; j++) {
			scanf("%d", &dis[i][j + 1]);
		}
	}
	for (int k = 1; k <= n; k++) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
			}
		}
	}
	printf("%d", dis[1][n]);
	return 0;
}
#endif