codefoce Cooking Time

 #include <bits/stdc++.h>
 using namespace std;
 struct T {  // 贪心 优先弹出相邻靠后的材料
     int id;
     int p;
     bool  operator < (const T& t) const {
         return p < t.p;
     }
 };
 const int N = 1e5 + ;
 const int inf = 0x3f3f3f3f;
 int a[N], sort_a[N], num;
 bool isok[N];
 int pre[N];
 int p[N];
 int n, k;
 priority_queue<T> q;
 inline int f (int x) {
     return lower_bound(sort_a + , sort_a +  + num, x) - sort_a; // 错误一 离散化后是num
 }
 int main ()
 {
     int w; scanf ("%d",&w);
     while (w--) {
         while (!q.empty()) q.pop();
         memset (isok, , sizeof(isok));
         scanf ("%d %d",&n,&k);
         for (int i = ; i <= n; i++)  {
             scanf ("%d", &a[i]);
             sort_a[i] = a[i];
         }
         sort (sort_a + , sort_a +  + n);
         num = ;
         for (int i = ; i <= n; i++) {
             if (sort_a[i] != sort_a[num])
                 sort_a[++num] = sort_a[i];
         }
         int sum = ; int t = ;
         for (int i = ; i <= num; i++)
             pre[i] = inf;
         for (int i = n; i >= ; i--) {
             int x = f(a[i]);// pre[i]  元素i最最近出现的位置
             p[i] = pre[x];// p[i] a[i] 与a[i]相同元素相邻位置
             pre[x] = i;
         }
         for (int i = ; i <= n; i++) {
             int x = f(a[i]);
             if (!isok[x]) {
                 sum++;
                 if (t < k) {
                     T temp = {x, p[i]};
                     q.push(temp);  isok[x] = ;
                     t++;
                 }
                 else {
                     T t1 = q.top(); q.pop(); isok[t1.id] = ;
                     T temp = {x, p[i]};
                     q.push(temp);  isok[x] = ;
                 }
             }
             else {// 错误二： 即使原来在内存中也要去更新它的位置
                 T temp= {x,p[i]};
                 q.push(temp);
             }
         }
         printf ("%d\n", sum);
 }
 return ;
 }

链接 ： http://codeforces.com/gym/101498/problem/F