P3514 [POI2011]LIZ-Lollipop

传送门

题目思路

题意为给定一个只有2和1的序列 给定m个询问 问哪个区间和为k(k为给定值) 输出左区间和右区间
我们可以通过求和得出最大和 可以想出给定一个和n(n > 2) 我们一定能从区间中找出和为n-2的自区间
如果两边任意一边的a为2我们可以删去一边得到 如果两边均为1则可以删去两边
故我们可以求出区间最大奇数和和偶数和 通过递归来遍历所有可得到数的区间

#include <bits/stdc++.h>

using namespace std;

const int N = 2e6 + 10;

int n, m;
int l[N], r[N], a[N], sum[N];
int omax = -1, emax = -1;
char c[N];

void solve(int x)
{
	if (x <= 2) return;
	if (a[l[x]] == 2) l[x - 2] = l[x] + 1, r[x - 2] = r[x];
	else if (a[r[x]] == 2) l[x - 2] = l[x], r[x - 2] = r[x] - 1;
	else l[x - 2] = l[x] + 1, r[x - 2] = r[x] - 1;
	solve(x - 2);
}

int main()
{
	scanf("%d%d%s", &n, &m, c + 1);
	
	memset(l, -1, sizeof l);
	memset(r, -1, sizeof r);
	
	for (int i = 1; i <= n; i ++ ) a[i] = c[i] == 'W' ? 1 : 2;
	for (int i = 1; i <= n; i ++ ) sum[i] = sum[i - 1] + a[i];
	
	if (sum[n] & 1) omax = sum[n], l[omax] = 1, r[omax] = n;
	else emax = sum[n], l[emax] = 1, r[emax] = n;
	
	int lx = -1, rx = -1, tmp = -1;
	for (int i = 1; i <= n; i ++ ) if (a[i] == 1) {lx = i; break;}
	for (int i = n; i >= 1; i -- ) if (a[i] == 1) {rx = i; break;}
	
	int ls = -1, rs = -1;
	if (lx != -1 && tmp < sum[n] - sum[lx]) tmp = sum[n] - sum[lx], ls = lx + 1, rs = n;
	if (rx != -1 && tmp < sum[rx - 1]) tmp = sum[rx - 1], ls = 1, rs = rx - 1;
	
	if (tmp != -1) 
	{
		if (tmp & 1) omax = tmp, l[omax] = ls, r[omax] = rs;
		else emax = tmp, l[emax] = ls, r[emax] = rs;
	}
	
	solve(omax);
	solve(emax);
	
	while (m -- )
	{
		int k;
		scanf("%d", &k);
		if (l[k] == -1 && r[k] == -1) puts("NIE");
		else printf("%d %d\n", l[k], r[k]);
	}
	
	return 0;
}