寒假每日练习：前缀和与差分

今天写了4道题：P8218,P1719,P1314,P2367，总体比较简单，现在普及-的已经基本没啥问题了，但提高的一点不行，还得练。

P8218和P1719都是模板题就直接上代码了：

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int a[100004];
int n, m, l, r;
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		int tmp;
		cin >> tmp;
		a[i] = a[i - 1] + tmp;
	}
	cin >> m;
	for (int i = 1; i <= m; i++)
	{
		cin >> l >> r;
		cout << a[r] - a[l - 1] << endl;
	}

	return 0;
}

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int dataa[125][125];
int n;
int ans = -100000;
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			int tmp;
			cin >> tmp;
			dataa[i][j] = dataa[i - 1][j] + dataa[i][j - 1] - dataa[i - 1][j - 1] + tmp;
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			for (int x = i; x <= n; x++)
			{
				for (int y = j; y <= n; y++)
				{
					int tm = dataa[x][y] - dataa[x][j-1] - dataa[i-1][y] + dataa[i-1][j-1];
					ans = max(tm, ans);
				}
			}
		}
	}
	cout << ans;
	return 0;
}

P1314是比较难的，主要是二分和前缀和的结合，这里提一句，我忘了初始化就看了半个小时，真是无语了！！

#include <iostream>
#include <algorithm>
#include <cmath>
#include <string.h>

using namespace std;

typedef long long ll;
const int N = 2e5 + 4;
ll n, m, s, ans, num, Y;
ll pre_n[N], pre_v[N];
int w[N], v[N];
int l[N], r[N];

bool check(int W)
{
	memset(pre_n, 0, sizeof(pre_n));
	memset(pre_v, 0, sizeof(pre_v));
	Y = 0;
	for (int i = 1; i <= n; i++)
	{
		if (w[i] >= W)
		{
			pre_n[i] = pre_n[i - 1] + 1;
			pre_v[i] = pre_v[i - 1] + v[i];
		}
		else {
			pre_n[i] = pre_n[i - 1];
			pre_v[i] = pre_v[i - 1];
 		}
	}
	for (int i = 1; i <= m; i++)
	{
		Y += (pre_n[r[i]] - pre_n[l[i] - 1]) * (pre_v[r[i]] - pre_v[l[i] - 1]);
	}
	num = llabs(Y - s);
	if (Y > s)
		return true;
	else {
		return false;
	}
}
int main()
{
	cin >> n >> m >> s;
	int mi = 10000000, ma = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> w[i] >> v[i];
		mi = min(w[i], mi);
		ma = max(w[i], ma);
	}
	for (int i = 1; i <= m; i++)
	{
		cin >> l[i] >> r[i];
	}
	int lw = mi - 1;
	int rw = ma + 2;
	int mid = (lw + rw) >> 1;
	ans = 1e12 + 4;
	while (lw <= rw)
	{
		mid = (lw + rw) >> 1;
		if (check(mid))
		{
			lw = mid + 1;
		}
		else {
			rw = mid - 1;
		}
		ans = min(ans, num);
	}
	cout << ans;
	return 0;
}

P2367就是差分的模板了：

#include <iostream>
#include <algorithm>
#include <cmath>
#include <string.h>

using namespace std;
int n, p;
int stu[5000004];
int cha[5000004];
int mi = 10000000;

void op(int x, int y, int z)
{
	cha[x] += z;
	cha[y + 1] -= z;
}

int main()
{
	cin >> n >> p;
	for (int i = 1; i <= n; i++)
	{
		cin >> stu[i];
		cha[i] = stu[i] - stu[i - 1];
	}
	for (int i = 1; i <= p; i++)
	{
		int x, y, z;
		cin >> x >> y >> z;
		op(x, y, z);
	}
	int tmp = cha[0];
	for (int i = 1; i <= n; i++)
	{
		mi = min(cha[i] + tmp, mi);
		tmp += cha[i];
	}
	cout << mi;
	return 0;
}