2011-07-18 09:44:04Morris
Mapped-Heap (映射二分堆)
/**********************************************************************************/
/* Problem: a068 "E. 看動畫 加强版" from NPSC 加强 */
/* Language: C */
/* Result: AC (944ms, 9032KB) on ZeroJudge */
/* Author: morris1028 at 2011-07-18 09:41:42 */
/**********************************************************************************/
#include<stdio.h>
int Input();
int next[1000001], pre[100001], A[1000001];
struct Heap {
int x, node;
}Heap[10001];/*max heap*/
int L, set[100001];
char exist[100001];
void Swap(int P, int S) {
int T;
T=Heap[P].x, Heap[P].x=Heap[S].x, Heap[S].x=T;
T=Heap[P].node, Heap[P].node=Heap[S].node, Heap[S].node=T;
set[Heap[S].node] = S, set[Heap[P].node] = P;
}
void siftup (int site) {
int S = site, P = site >> 1;
while(S >= 2 && Heap[P].x < Heap[S].x)
Swap(P, S), S = P, P = S >> 1;
}
void siftdown(int site) {
int P = site, S = site << 1;
while(S <= L) {
if(S < L && Heap[S+1].x > Heap[S].x) S++;
if(Heap[P].x >= Heap[S].x) break;
Swap(P, S), P = S, S = P << 1;
}
}
void insHeap(int site, int node, int t) {/*insert new node*/
Heap[site].node = node;
Heap[site].x = next[t];
set[node] = site, exist[node] = 1;
siftup(site);
}
void delHeap() {/*delete last node*/
exist[Heap[1].node] = 0;
Swap(1, L), L--;
siftdown(1);
}
void modHeap(int site, int t) {/*modify old node*/
Heap[site].x = t;
siftup(site);
}
main() {
int t, n, m;
scanf("%d", &t);
while(t--) {
scanf("%d %d", &n, &m);
int a, Ans = 0;
for(a = 0, L = 0; a < 100001; a++) /*initiate*/
pre[a] = 0, exist[a] = 0;
for(a = 1; a <= n; a++) {
A[a] = Input();
if(pre[A[a]])
next[pre[A[a]]] = a;
pre[A[a]] = a;
}
for(a = 0; a < 100001; a++)
if(pre[a])
next[pre[a]] = n+1;
for(a = 1; a <= n; a++) {
if(exist[A[a]]) {/*heap->p (next adjust)*/
modHeap(set[A[a]], next[a]);
continue;
}
if(L == m) {/*pull out*/
Ans++;
delHeap();
}
L++, insHeap(L, A[a], a);
}
printf("%d\n", Ans);
}
return 0;
}
int Input() {
char cha;
unsigned int x = 0;
while(cha = getchar())
if(cha != ' ' && cha != '\n') break;
x = cha-48;
while(cha = getchar()) {
if(cha == ' ' || cha == '\n') break;
x = x*10 + cha-48;
}
return x;
}
/* Problem: a068 "E. 看動畫 加强版" from NPSC 加强 */
/* Language: C */
/* Result: AC (944ms, 9032KB) on ZeroJudge */
/* Author: morris1028 at 2011-07-18 09:41:42 */
/**********************************************************************************/
#include<stdio.h>
int Input();
int next[1000001], pre[100001], A[1000001];
struct Heap {
int x, node;
}Heap[10001];/*max heap*/
int L, set[100001];
char exist[100001];
void Swap(int P, int S) {
int T;
T=Heap[P].x, Heap[P].x=Heap[S].x, Heap[S].x=T;
T=Heap[P].node, Heap[P].node=Heap[S].node, Heap[S].node=T;
set[Heap[S].node] = S, set[Heap[P].node] = P;
}
void siftup (int site) {
int S = site, P = site >> 1;
while(S >= 2 && Heap[P].x < Heap[S].x)
Swap(P, S), S = P, P = S >> 1;
}
void siftdown(int site) {
int P = site, S = site << 1;
while(S <= L) {
if(S < L && Heap[S+1].x > Heap[S].x) S++;
if(Heap[P].x >= Heap[S].x) break;
Swap(P, S), P = S, S = P << 1;
}
}
void insHeap(int site, int node, int t) {/*insert new node*/
Heap[site].node = node;
Heap[site].x = next[t];
set[node] = site, exist[node] = 1;
siftup(site);
}
void delHeap() {/*delete last node*/
exist[Heap[1].node] = 0;
Swap(1, L), L--;
siftdown(1);
}
void modHeap(int site, int t) {/*modify old node*/
Heap[site].x = t;
siftup(site);
}
main() {
int t, n, m;
scanf("%d", &t);
while(t--) {
scanf("%d %d", &n, &m);
int a, Ans = 0;
for(a = 0, L = 0; a < 100001; a++) /*initiate*/
pre[a] = 0, exist[a] = 0;
for(a = 1; a <= n; a++) {
A[a] = Input();
if(pre[A[a]])
next[pre[A[a]]] = a;
pre[A[a]] = a;
}
for(a = 0; a < 100001; a++)
if(pre[a])
next[pre[a]] = n+1;
for(a = 1; a <= n; a++) {
if(exist[A[a]]) {/*heap->p (next adjust)*/
modHeap(set[A[a]], next[a]);
continue;
}
if(L == m) {/*pull out*/
Ans++;
delHeap();
}
L++, insHeap(L, A[a], a);
}
printf("%d\n", Ans);
}
return 0;
}
int Input() {
char cha;
unsigned int x = 0;
while(cha = getchar())
if(cha != ' ' && cha != '\n') break;
x = cha-48;
while(cha = getchar()) {
if(cha == ' ' || cha == '\n') break;
x = x*10 + cha-48;
}
return x;
}
上一篇：鏈結 Stack (堆疊)