P1854 花店橱窗布置（dp）,dp6

//https://www.luogu.com.cn/problem/P1854
#include<bits/stdc++.h>
#include<unordered_map>
#include<array>
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(),a.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;

int n, m, a[105][105], dp[105][105];

void solve()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> a[i][j];
	memset(dp, -inf, sizeof dp);
	fill(dp[0], dp[0] + m + 1, 0);
	for (int i = 1; i <= n; i++)
		for (int j = i; j <= m - (n - i); j++)//第i束花可放的位置区间是[i, m - (n - i)]
			for (int k = i - 1; k < j; k++)//枚举前一束花的位置， 进行转移
				dp[i][j] = max(dp[i][j], dp[i - 1][k] + a[i][j]);
	int ans = 0;
	for (int j = n; j <= m; j++)
		ans = max(ans, dp[n][j]);
	vector<int> v;
	int id, val, pre = m + 1;
	for (int i = n; i >= 1; i--)//从后往前依次确定每一束花的位置， 若第i + 1束花的位置为pre， 则第i束花的位置区间为[i, pre - 1]
	{
		val = -inf;
		for (int j = i; j < pre; j++)
		{
			if (dp[i][j] > val) 
				val = dp[i][j], id = j;
		}
		v.emplace_back(id);
		pre = id;
	}
	cout << ans << '\n';
	reverse(all(v));
	for (auto it : v)
		cout << it << ' ';
}

signed main()
{
	IOS;
	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}

#include<bits/stdc++.h>
#include<unordered_map>
#include<array>
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(),a.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;

int n, m, a[105][105], dp[105][105];

void print(int l, int r)//递归输出
{
	int id, val = -inf;
	for (int i = l; i <= r; i++)
	{
		if (dp[l][i] > val)
			val = dp[l][i], id = i;
	}
	if(l > 1)
		print(l - 1, id - 1);
	cout << id << ' ';
}

void solve()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> a[i][j];
	memset(dp, -inf, sizeof dp);
	fill(dp[0], dp[0] + m + 1, 0);
	for (int i = 1; i <= n; i++)
		for (int j = i; j <= m - (n - i); j++)//第i束花可放的位置区间是[i, m - (n - i)]
			for (int k = i - 1; k < j; k++)//枚举前一束花的位置， 进行转移
				dp[i][j] = max(dp[i][j], dp[i - 1][k] + a[i][j]);
	int ans = 0;
	for (int j = n; j <= m; j++)
		ans = max(ans, dp[n][j]);
	cout << ans << '\n';
	print(n, m);
}

signed main()
{
	IOS;
	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}