[POI2005]SAM-Toy Cars（洛谷P3419）

[POI2005]SAM-Toy Cars

题目描述

Johnny is a little boy - he is only three years old and enjoys playing with toy cars very much. Johnny has nn different cars. They are kept on a shelf so high, that Johnny cannot reach it by himself. As there is little space in his room, at no moment may there be more than kk toy cars on the floor.

Johnny plays with one of the cars on the floor. Johnny’s mother remains in the room with her son all the time. When Johnny wants to play with another car that is on the floor, he reaches it by himself. But when the toy is on the shelf, his mummy has to hand it to him. When she gives Johnny one car, she can at the same time pick any car from the floor and put it back on the shelf (so that there remains sufficient space on the floor).

The mother knows her child very well and therefore can predict perfectly which cars Johnny will want to play with. Having this knowledge, she wants to minimize the number of times she has to hand Johnny a toy from the shelf. Keeping that in mind, she has to put the toys off on the shelf extremely thoughtfully.

TaskWrite a programme that:

reads from the standard input the sequence of toy cars in order in which Johnny will want to play with them,calculates the minimal number of times the mother has to pick cars from the shelf,writes the result to the standard output.

Jasio 是一个三岁的小男孩,他最喜欢玩玩具了,他有n 个不同的玩具,它们都被放在了很高的架子上所以Jasio 拿不到它们. 为了让他的房间有足够的空间,在任何时刻地板上都不会有超过k 个玩具. Jasio 在地板上玩玩具. Jasio’的妈妈则在房间里陪他的儿子. 当Jasio 想玩地板上的其他玩具时,他会自己去拿,如果他想玩的玩具在架子上,他的妈妈则会帮他去拿,当她拿玩具的时候,顺便也会将一个地板上的玩具放上架子使得地板上有足够的空间. 他的妈妈很清楚自己的孩子所以他能够预料到Jasio 想玩些什么玩具. 所以她想尽量的使自己去架子上拿玩具的次数尽量的少,应该怎么安排放玩具的顺序呢?

输入格式

In the first line of the standard input there are three integers: nn,kk,pp (1\le k\le n\le 100\ 0001≤k≤n≤100 000, 1\le p\le 500\ 0001≤p≤500 000), separated by single spaces. These denote respectively: the total number of cars, the number of cars that can remain on the floor at once and the length of the sequence of cars which Johnny will want to play with. Each of the following pp lines contains one integer. These integers are the numbers of cars Johnny will want to play with (the cars are numbered from 11 to nn).

输出格式

In the first and only line of the standard output one integer should be written - the minimal number of times his mother has to pick a car from the shelf.

输入 #1

3 2 7
1
2
3
1
3
1
2

输出 #1

4

贪心+优先队列；

1.找出每个元素后面一次的出现的位置，这是贪心的依据；用nex[]数组表示，nex[i]=a;表示在 i 位置的元素下一个位置为 a ；

2.贪心的思想就是每次拿玩具的时候都把一个下次出现最晚的玩具放在柜子上；把每个位置上的玩具下一次出现的位置放进一个队里面，每次取队顶就行；

3.记录地面已经有的玩具，如果有直接跳过，反之进队操作；

4.坑点，就是当地面有那个玩具时，我们直接跳过，队里面的那个玩具的下一次出现位置不能更新；显然，它已经是队底元素，也就是说队里面最后一个元素，我们可以不用管它，直接让新元素入队，然后使队的大小++；

5.必须是先出队后入队，应为要先找出一个玩具放进柜顶，在从柜顶拿一个玩具下来；

代码：

#include<bits/stdc++.h>
#define LL long long
#define pa pair<int,int>
using namespace std;
priority_queue< int >qu;
queue<int>q[100100];
int a[500100],nex[500100];
bool vis[100100];
int main(){
	int n,k,p;
	scanf("%d%d%d",&n,&k,&p);
	for(int i=1;i<=p;i++){
		scanf("%d",&a[i]);
		q[a[i]].push(i);
	}
	for(int i=1;i<=p;i++){
		q[a[i]].pop();
		if(q[a[i]].empty()) nex[i]=p+1;
		else nex[i]=q[a[i]].front();//位置为i的数下一次出现位置
	}
	int ans=0;
	for(int i=1;i<=p;i++){
		if(vis[a[i]]){//表示地面已经有了 
			qu.push(nex[i]);
			k++;
		}
		else{
			ans++;
			while(qu.size()>k-1){//先出后加 
				int x=qu.top();
				vis[a[x]]=false;
				qu.pop();
			}
			qu.push(nex[i]);
			vis[a[i]]=true;
		}
	}
	printf("%d\n",ans);
	return 0;
}