【bzoj 1826&1528】: [JSOI2010]缓存交换

传送门

http://www.lydsy.com/JudgeOnline/problem.php?id=1826

http://www.lydsy.com/JudgeOnline/problem.php?id=1528

贪心，每次选择最靠后的，证明待脑补

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
/************************************************
Code By willinglive
************************************************/
/
#define rep(i,l,r) for(int i=l,___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=r,___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int getint()
{
    int r=0,k=1;char c=getchar();
    for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
    for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0'; 
    return k*r;
}
/
int n,m;
int a[100010];
map <int,int>head;
int next[100010];
typedef pair<int,int>pii;
priority_queue<pii>q;
bool inq[100010];
int cnt=0;
/

/
void input()
{
	MS(next,0x3f);
    scanf("%d%d",&n,&m);
    rep(i,1,n)
    {
    	scanf("%d",&a[i]);
    	if(!head[a[i]]) head[a[i]]=++cnt;
		a[i]=head[a[i]];
    }
    head.clear();
    per(i,n,1)
    {
    	if(!head[a[i]])
    	{
    		head[a[i]]=i;
    		next[i]=0x3f3f3f3f;
    		continue;
    	}
    	next[i]=head[a[i]];
    	head[a[i]]=i;
    }
}
void solve()
{
	int ans=0;
	int cur;
    for(cur=1;cur<=n;cur++)
    {
    	if(!inq[a[cur]]) ans++;
    	q.push(make_pair(next[cur],a[cur]));
    	inq[a[cur]]=1;
    	//printf("%d ",cur);
    	if(ans==m) break;
    }
	for(cur++;cur<=n;cur++)
    {
    	//printf("%d ",cur);
    	if(inq[a[cur]])
    	{
    		//q.pop();
    		q.push(make_pair(next[cur],a[cur]));
    		continue;
    	}
    	inq[q.top().second]=0;
    	//printf("not pop:%d %d\n",q.top().second,q.top().first);
    	q.pop();
    	//printf("has pop:%d %d\n",q.top().second,q.top().first);
    	ans++;
    	q.push(make_pair(next[cur],a[cur]));
    	inq[a[cur]]=1;
    }
    printf("%d\n",ans);
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("WL.out","w",stdout);
    #endif
    input();
    solve();
    return 0;
}