UVa #11536 Smallest Sub-Array (习题8-17)

理解题目：有一些不同颜色的散点分布在整数数轴上，找出一条最短的线段，使得线段内存在所有颜色的点

一开始觉得有点像是区间覆盖问题，但是这里的散点和区间的性质有些不同，似乎无法直接使用贪心法

然后考虑，题目的描述有点像滑动窗口，故尝试滑动窗口+二分查找找出窗口大小的最小值

运行时间是有惊无险的7s，由于要求的是8s，所以我的算法是一半TLE一半AC。等复习白书的时候再回过头来优化这道题

Run Time: 7.085s

#define UVa  "8-17.11536.cpp"		//Smallest Sub-Array
char fileIn[30] = UVa, fileOut[30] = UVa;

#include<cstring>
#include<cstdio>
#include<vector>
#include<set>

using namespace std;

struct Event {
    int v, pos;
    Event(int a, int b):v(a),pos(b){}
};

//Global Variables. Reset upon Each Case!
const int maxn = 1000001 + 10, maxm = 1000 + 10, maxk = 101 + 10;
int X[maxn];
int T, N, M, K;
int cnt[maxm];
vector<Event> events;
/

int valid(int wsize) {
    int cnt[maxk];
    memset(cnt, 0, sizeof(cnt));
    set<int> s;
    int eventpl = 0, eventpr = 0;
    for(int i = 0; i < events.size(); i ++) {   //set initial window.
        if(events[i].pos <= wsize - 1) {        //valid pos: 0 - (wsize-1)
            cnt[events[i].v] ++;
            s.insert(events[i].v);
            eventpr ++;
        }
        else break;
    }
    if(s.size() == K) return 1;
    for(int i = 0; i <= N-wsize; i ++) {       //moving sliding window.
        int l_bound = i, r_bound = i + wsize - 1;
        while(events[eventpr].pos == r_bound) {      //element in.
            Event& e = events[eventpr];
            cnt[e.v] = cnt[e.v] + 1;
            s.insert(e.v);
            eventpr ++;
        }
        if(s.size() == K) return 1;
        while(events[eventpl].pos == l_bound) {      //element out.
            Event& e = events[eventpl];
            cnt[e.v] = cnt[e.v] - 1;
            if(cnt[e.v] == 0) s.erase(e.v);
            eventpl ++;
        }
    }
    return 0;
}

int main() {
    scanf("%d", &T);
    for(int kase = 1; kase <= T; kase ++) {
        memset(cnt, 0, sizeof(cnt));
        events.clear();
        scanf("%d%d%d", &N, &M, &K);
        for(int i = 0; i < 3; i ++) {
            X[i] = i + 1;
            if(i+1 <= K) events.push_back(Event(i+1, i));
        }
        for(int i = 3; i < N; i ++) {
            int a = ( X[i-1] + X[i-2] + X[i-3] ) % M + 1;
            X[i] = a;
            if(a <= K) events.push_back(Event(a, i));
        }

        int minsize = 1, maxsize = N+1;     //maxsize will not be used as wsize.
        while(minsize < maxsize) {
            int wsize = (minsize + maxsize) / 2;
            if(valid(wsize)) maxsize = wsize;
            else minsize = wsize + 1;
        }
        printf("Case %d: ", kase);
        if(minsize > N ) printf("sequence nai\n");
        else printf("%d\n", minsize);
    }
    return 0;
}