2019省赛选拔 Longest Subarray题解（尺取）

题目链接

题目思路

首先可以直接用二分，但是我一直不知道怎么check，一直在想维护最大值和次大值，结果发现，其实只要维护大于k的值就行了。而后面发现可以尺取，尺取几行就没了。。。相当于回顾一下尺取吧

二分代码

#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define debug printf(" I am here\n");
using namespace std;
typedef long long ll;
typedef pair<int,pair<int,int> > pii;
const int maxn=3e5+5,mod=998244353,inf=0x3f3f3f3f;
const double eps=1e-10;
int n,k,c,a[maxn],vis[maxn],flag[maxn];
bool check(int len){
    int cnt=0;
    memset(vis,0,sizeof(vis));
    memset(flag,0,sizeof(flag));
    for(int i=1;i<=n;i++){
        if(i<=len){
            vis[a[i]]++;
            if(!flag[a[i]]&&vis[a[i]]>k){
                flag[a[i]]=1;
                cnt++;
            }
        }else{
            vis[a[i]]++;
            if(!flag[a[i]]&&vis[a[i]]>k){
                flag[a[i]]=1;
                cnt++;
            }
            vis[a[i-len]]--;
            if(flag[a[i-len]]&&vis[a[i-len]]<=k){
                flag[a[i-len]]=0;
                cnt--;
            }
        }
        if(i>=len&&cnt==0){//只要有一类满足就好
            return true;
        }
    }
    return false;
}
signed main(){
    scanf("%d%d%d",&n,&k,&c);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    int l=1,r=n,ans;
    while(l<=r){
        int mid=(l+r)/2;
        if(check(mid)){
            ans=mid;
            l=mid+1;
        }else{
            r=mid-1;
        }
    }
    printf("%d\n",ans);
    return 0;
}

尺取

#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define debug printf(" I am here\n");
using namespace std;
typedef long long ll;
typedef pair<int,pair<int,int> > pii;
const int maxn=3e5+5,mod=998244353,inf=0x3f3f3f3f;
const double eps=1e-10;
int n,k,c,a[maxn],cnt[maxn];
signed main(){
    scanf("%d%d%d",&n,&k,&c);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    int l=1,r=1,ans=1;
    cnt[a[1]]++;
    while(r<n){
        if(cnt[a[r+1]]+1<=k){
            cnt[a[r+1]]++;
            r++;
        }else{
            cnt[a[l]]--;
            l++;
        }
        ans=max(ans,r-l+1);
    }
    printf("%d\n",ans);
    return 0;
}