2021-05--01 Educational Codeforces Round 108 (Rated for Div. 2)

呜呜，伤心的一场，A题没开long long ，罚坐了好久才幡然醒悟，直接爆炸。
以后一定要记得有乘积开long long，记得%lld
传送门

A. Red and Blue Beans

因为没开long long wa了好几次，还怀疑了好久自己推的公式。

#include <bits/stdc++.h>
using namespace std;

const int N = 10;
typedef long long ll;
typedef pair<int, int> PII;

ll t, r, b, d;

int main()
{
	cin >> t;
	ll r1, b1;
	while (t -- )
	{
		cin >> r >> b >> d;
		if (r <= b) r1 = r, b1 = b;
		else r1 = b, b1 = r;
		if (r1 * (1 + d) >= b1) puts("YES");
		else puts("NO");
	}
	return 0;
}

B. The Cake Is a Lie

刚看到这题还是挺迷茫的。随便画了画其实就是个定值。

#include <bits/stdc++.h>
using namespace std;

const int N = 10;
typedef long long ll;
typedef pair<int, int> PII;

int main()
{
	int t, n, m, k;
	cin >> t;
	while (t -- )
	{
		cin >> n >> m >> k;
		if (k == (n - 1) + n * (m - 1)) puts("YES");
		else puts("NO"); 
	}
	return 0;
}

C. Berland Regional

前辍和。
每个学校分开来算。算完累加。
这题其实不难，可以写。

#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
const int N = 2e5 + 20;

int t, n;
int u[N], s;
ll ans[N], pre[N];
vector<int> save[N]; 

bool cmp(int &x, int &y)
{
	return x > y;
}

int main()
{
	cin >> t;
	while (t -- )
	{
		cin >> n;
		for (int i = 1; i <= n; i ++ )
		{
			save[i].clear();
			cin >> u[i]; 
			ans[i] = 0;
		} 
		for (int i = 1; i <= n; i ++ ) 
		{
			cin >> s;
			save[u[i]].push_back(s);
		}
		for (int i = 1; i <= n; i ++ )
		{
			int sz = save[i].size();
			if (!sz) continue;
			sort(save[i].begin(), save[i].end(), cmp);
			for (int j = 1; j <= sz; j ++ )
				pre[j] = pre[j - 1] + save[i][j - 1];
			for (int k = 1; k <= sz; k ++ )
				ans[k] += pre[sz / k * k];
		}
		for (int i = 1; i <= n; i ++ )
			printf("%lld ", ans[i]);
		puts("");
	}
	return 0;
}

D. Maximum Sum of Products

状态表示：f[i , j]集合：a数组和b数组i到j的数。
属性：将期中一个数组的idaoj个数反转后于b数组i到j个数的乘积和。
状态计算f[i , j] = f[i + 1, j - 1] + a[i]*b[j] + b[i]*a[j]。
先对区间为1和区间为2的赋初值。

#include <bits/stdc++.h>
using namespace std;

const int N = 5050;
typedef long long ll;
typedef pair<int, int> PII;

int n;
ll a[N], b[N];
ll l[N], r[N]; 
ll dp[N][N];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i ++ ) cin >> a[i];
	for (int i = 1; i <= n; i ++ ) cin >> b[i];
	for (int i = 1; i <= n; i ++ )
		l[i] = l[i - 1] + a[i] * b[i];
	for (int i = n; i >= 1; i -- )
		r[i] = r[i + 1] + a[i] * b[i];
	for (int i = 1; i <= n; i ++ )
		dp[i][i] = a[i] * b[i];
	for (int i = 1; i < n; i ++ )
		dp[i][i + 1] = a[i] * b[i + 1] + a[i + 1] * b[i];
	for (int len = 3; len <= n; len ++ )
		for (int i = 1; i + len - 1 <= n; i ++ )
		{
			int j = i + len - 1;
			dp[i][j] = a[i] * b[j] + a[j] * b[i] + dp[i + 1][j - 1]; 
		}
	ll sum = 0;
	for (int i = 1; i <= n; i ++ )
		for (int j = i; j <= n; j ++ )
			sum = max(sum, dp[i][j] + l[i - 1] + r[j + 1]);
	cout << sum << endl;
	
	return 0;
}