ZOJ-3790

本来以为是DP，后来发现是模拟。。思路如下，先按种类存入map，每个颜色记录连续段的长度和末位置，存入列表，然后针对每种颜色寻找remove最多K个格后的最大连续段，注意是最多remove K个，而不是精确K个，用一个队列来搞，记录当前状态最多可移除的量，不断push队列尾连续段，如果可移除量不够了，就pop队首，这样可移除量就增加了，中间不断更新最大连续段

#include<cstdio>
#include<deque>
#include<map>
#include<vector>
#include<algorithm>

using namespace std;

namespace
{
	deque<pair<int, int> > Q;

	int solve(const vector<pair<int, int> > &v, const int K)
	{
		int res = 0, now = K;
		Q.clear();
		Q.push_back(v.front());
		int len = v.front().first;
		res = max(res, len);
		for (size_t i = 1; i < v.size(); i++)
		{
			now -= v[i].second - v[i].first - Q.back().second;
			Q.push_back(v[i]);
			len += v[i].first;
			while (now < 0)
			{
				pair<int, int> p = Q.front();
				Q.pop_front();
				now += Q.front().second - Q.front().first - p.second;
				len -= p.first;
			}
			res = max(res, len);
		}
		return res;
	}

	void put(map<int, vector<pair<int, int> > > &M, int key, int count, int end)
	{
		if (M.find(key) != M.end())
			M[key].push_back(make_pair(count, end));
		else
		{
			vector<pair<int, int> > v;
			v.push_back(make_pair(count, end));
			M[key] = v;
		}
	}
}

int main()
{
	int N, K, C;
	map<int, vector<pair<int, int> > > M;
	while (scanf("%d %d", &N, &K) != EOF)
	{
		M.clear();
		int prev = 0, count = 0;
		for (int i = 0; i < N; i++)
		{
			scanf("%d", &C);
			if (!prev)
				count = 1;
			else if (C == prev)
				count++;
			else
			{
				put(M, prev, count, i - 1);
				count = 1;
			}
			prev = C;
		}
		put(M, prev, count, N - 1);
		int res = 0;
		for (map<int, vector<pair<int, int> > >::iterator it = M.begin();
				it != M.end(); it++)
			res = max(res, solve((*it).second, K));
		printf("%d\n", res);
	}
	return 0;
}