18.8.28 考试吐槽

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5; 
int n,T,C,las[4],fr[4],bc[4],S,a[N],ans[4];
struct position {
    
    int ppos[4],fpos[4];
}s[N];

void init( ) {
    
    memset(las,0,sizeof(las));
    for(int i = 1;i <= S;i ++) {
        if(a[i] != -1) las[a[i]] = i;
        for(int j = 0;j < C;j ++)
          s[i].ppos[j] = las[j];
    }
    for(int i = 0;i < 4;i ++) las[i] = S + 1;
    for(int i = S;i >= 1;i --) {
        if(a[i] != -1) las[a[i]] = i;
        for(int j = 0;j < C;j ++)
          s[i].fpos[j] = las[j];
    }
}

void solve( ) {
    
    for(int len = C;len < N + C;len ++) {
        for(int i = 0;i < C;i ++) fr[i] = len;
        memset(bc,0,sizeof(bc));
        int st = 1;
        while(st <= S) {
            int side = min(S,st + len - 1);
            for(int i = 0;i < C;i ++) {
                if(s[st].fpos[i] <= side)
                    fr[i] = min(s[st].fpos[i] - st,fr[i]);//相当于小字符串起始位置是0
                if(s[side].ppos[i] >= i)
                    bc[i] = max(s[side].ppos[i] - st + 1,bc[i]);//这里多加1 表示下个区间的左端点 
            }
            st = side + 1;
        }
        bool tag = false;
        for(int c = 0;c < C;c ++) {
            if(bc[c] == 0)// 还未出现过 
                  fr[c] = c ? bc[c - 1] : 0,bc[c] = fr[c] + 1;
            else if(fr[c] > (c ? bc[c - 1] : 0)) 
                  fr[c] = c ? bc[c - 1] : 0;
            else if(c && fr[c] < bc[c - 1]) //严格< 因为右端点多了一 
                  tag = true;
        } 
        if(tag) continue;
        if (bc[C - 1] > len)
            continue;
        bc[C - 1] = len;
        int c;
        for (c = 0;c < C - 1 && ans[c] == bc[c] - fr[c];c ++);//可以直接做差 
        if (c < C - 1 && ans[c] > bc[c] - fr[c])
            for (c = 0;c < C;c ++)
                ans[c] = bc[c] - fr[c];
    }
    
}

int main( ) {
    
    freopen("char.in","r",stdin);
    freopen("char.out","w",stdout);
    scanf("%d%d",& T,& C);
    while(T --) {
        memset(a,-1,sizeof(a));
         S = 0;
        scanf("%d",& n);
        for(int i = 1;i <= n;i ++) {
            int p,ss;
            scanf("%d%d",& p,& ss);
            a[p] = ss;
            S = max(S,p);
        }
        for(int i = 0;i < C;i ++) ans[i] = S + C;
        init( );
        solve( );
        if(ans[0] == S + C) printf("NO\n");
        else {
            for(int i = 0;i < C - 1;i ++)
              printf("%d ",ans[i]);
            printf("%d\n",ans[C - 1]);
        }
    }
}