cf1204E(div2)E

DP好题

题意:

- 给定n,m分别代表你有n个1, m个-1.

- 现在让这些m + n个元素随意组合, 对所有组成序列的前缀和的最大值求和

数据范围: $n\le 2000,m\le 2000$

>> face <<

前置技能: dp

看到范围之后很容易想到是个dp, 但是想不到状态转移方程, 看了大佬的blog觉得自己又学到了

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
const int maxn = 2e3 + 5, mod = 998244853;
int n, m;

const int maxm = 4e3 + 5;
ll C[maxm][maxn];
void init()
{
	_for(i, 0, maxm)
		C[i][0] = 1;

	_for(i, 0, maxn)
		C[i][i] = 1;
	_for(i, 2, maxm)
	{
		_for(j, 1, i)
		{
			C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
		}
	}
}
signed main()
{
	vector<vector<ll>> dp(n + 1, vector<ll>(m + 1, 0)), p(n + 1, vector<ll>(m + 1, 0));
	cin >> n >> m;
	_rep(i, 1, m)
		p[0][i] = 1;

	_rep(i, 1, n)
	{
		_rep(j, 1, m)
		{
			if (i <= j)
			{
				p[i][j] = p[i][j - 1] + p[i - 1][j];
				p[i][j] %= mod;
			}
		}
	}
	init();
	_rep(i, 1, n)
		dp[i][0] = i;

	_rep(i, 1, n)
	{
		_rep(j, 1, m)
		{
			dp[i][j] = max((dp[i - 1][j] + C[j + i - 1][i - 1] + dp[i][j - 1] - C[i + j - 1][j - 1] + p[i][j - 1] + mod) % mod, dp[i][j]);
		}
	}
	cout << dp[n][m] << endl;
}