no crossing 代码源div1每日一题（区间dp）

最新推荐文章于 2024-09-14 22:25:23 发布

蔡珏

最新推荐文章于 2024-09-14 22:25:23 发布

阅读量260

点赞数

文章标签：动态规划算法 c++

原文链接：https://blog.csdn.net/two_big_monkey/article/details/123177237?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522165138597616781685315196%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=165138597616781685315196&bi

版权

no crossing
大佬题解

/*********************************************************************
    程序名:
    版权: Joecai
    作者: Joecai
    日期: 2022-05-01 20:13
    说明:
*********************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
# define rep(i,be,en) for(int i=be;i<=en;i++)
# define pre(i,be,en) for(int i=be;i>=en;i--)
#define ll long long
#define endl "\n"
#define LOCAL
#define pb push_back
typedef pair<ll, ll> PII;
#define eb emplace_back
#define sp(i) setprecision(i)
const int N = 2e3 + 10, INF = 0x3f3f3f3f;
int n, k, m;
int mp[101][101];
int dp[101][1001][1001][2];  //目前选了几个点i j 允许下个点到达的左右区间（开区间），此时在左端点还是在右端点



void solve()
{
	cin >> n >> k >> m;
	memset(mp, 0x3f, sizeof(mp));
	memset(dp, 0x3f, sizeof(dp));
	for (int i = 1; i <= m; i++)
	{
		int a, b, c;
		cin >> a >> b >> c;
		mp[a][b] = min(mp[a][b], c);
	}

	for (int i = 1; i <= n; i++)
	{
		dp[1][0][i][1] = 0;
		dp[1][i][n + 1][0] = 0;
	}

	for (int t = 2; t <= k; t++)
	{
		for (int l = 0; l <= n - 1; l++)
		{
			for (int r = l; r <= n + 1; r++)
			{
				for (int mid = l + 1; mid <= r - 1; mid++)
				{
					dp[t][l][mid][1] = min({dp[t - 1][l][r][1] + mp[r][mid], dp[t][l][mid][1], dp[t - 1][l][r][0] + mp[l][mid]});
					dp[t][mid][r][0] = min({dp[t - 1][l][r][0] + mp[l][mid], dp[t][mid][r][0], dp[t - 1][l][r][1] + mp[r][mid]});

				}
			}
		}
	}
	int ans = 0x3f3f3f3f;
	for (int i = 0; i <= n; i++)
	{
		for (int j = i; j <= n + 1; j++)
		{
			ans = min({ans, dp[k][i][j][1], dp[k][i][j][0]});
		}
	}
	if(ans==0x3f3f3f3f) ans=-1;
	cout << ans << endl;

}




signed main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	//#ifdef LOCAL
	//freopen("data.in.txt","r",stdin);
	//freopen("data.out.txt","w",stdout);
	//#endif
	int __ = 1;
	//cin>>__;
	while (__--)
	{
		solve();
	}
	return 0;
}