信息学奥赛一本通 2.9.1：动态规划的基本模型

最新推荐文章于 2024-02-11 18:19:59 发布

中学生信竞

最新推荐文章于 2024-02-11 18:19:59 发布

阅读量271

点赞数

分类专栏：中学生信竞

本文链接：https://blog.csdn.net/davidliule/article/details/116347297

版权

1258 数字金字塔

1288 三角形最佳路径问题

#include <iostream>
#include <cstdio>
using namespace std;

const int N = 1010;
int n, a[N][N], f[N];

int main() {
   
	cin >> n;
	for (int i = 1; i <= n; i ++) {
   
		for (int j = 1; j <= i; j ++) {
   
			cin >> a[i][j];
		}
	}

	for (int i = n; i >= 1; i --) {
   
		for (int j = 1; j <= i; j ++) {
   
			f[j] = max(f[j], f[j+1]) + a[i][j];
		}
	}
	cout << f[1];
	
	return 0;
}

1284 摘花生

#include <iostream>
#include <cstring>
using namespace std;

const int N = 105;
int a[N][N], f[N];

int main() {
   
	int t;
	cin >> t;
	
	while (t --) {
   
		int r, c;
		cin >> r >> c;
		for (int i = 1; i <= r; i ++) {
   
			for (int j = 1; j <= c; j ++) {
   
				cin >> a[i][j];
			}
		}
		
		memset(f, 0, sizeof(f));
		for (int i = 1; i <= r; i ++) {
   
			for (int j = 1; j <= c; j ++) {
   
				f[j] = max(f[j], f[j-1]) + a[i][j];
			}
		}
		cout << f[c] << endl;
	}
	
	return 0;
}

1287 最低通行费

#include <iostream>
#include <cstring>
using namespace std;

const int N = 105;
int a[N][N], f[N];

int main() {
   
	int n;
	cin >> n;
	
	for (int i = 1; i <= n; i ++) {
   
		for (int j = 1; j <= n; j ++) {
   
			cin >> a[i][j];
		}
	}

	for (int i = 1; i <= n; i ++) {
   
		for (int j = 1; j <= n; j ++) {
   
			if (i == 1) f[j] = f[j-1] + a[i][j];
			else if (j == 1) f[j] = f[j] + a[i][j];
			else f[j] = min(f[j], f[j-1]) + a[i][j];
		}
	}
	cout << f[n] << endl;
	
	return 0;
}

1261 城市交通路网

#include <cstdio>
#include <iostream>
#include <cstring>

using namespace std;

const int N = 1e3 + 10;
int n, x, e[N][N], next[N];

int main() {
   
	cin >> n;
	
	memset(e, 0x3f, sizeof(e));
	for (int i = 1; i <= n; i ++) {
   
		for (int j = 1; j <= n; j ++) {
   
			cin >> x;
			if (x) e[i][j] = x;
		}
	}

	for (int i = n-1; i >= 1