题意:
求连续最短的子序列,是其包括【1,K】
思路:
一开始无脑上去暴力然后果不其然的TLE了()
本题可以使用滑动窗口算法来解决。
代码:
#include<map>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define Endl "\n"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e6+5;
const int INF = 0x3f3f3f;
const int mod = 1e9 + 7;
const double pi = acos(-1);
inline ll read(){
ll x = 0, f = 1; char ch; ch = getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int T;
int cases=0;
ll N,M,K;
int a[maxn],vis[maxn];
void fun()
{
a[0]=1;
a[1]=2;
a[2]=3;
for(int i=3;i<N;i++)
a[i]=(a[i-1]+a[i-2]+a[i-3])%M+1;
return ;
}
void solve() {
N=read(),M=read(),K=read();
fun();
memset(vis,0,maxn);
int ans=maxn;
int head=0,tail=0;
int num=0;
for(tail=0;tail<N;tail++)
{
if(a[tail]>=1&&a[tail]<=K)
{
if(!vis[a[tail]]) num++;
vis[a[tail]]++;
// cout<<tail<<" "<<a[tail]<<" "<<vis[a[tail]]<<Endl;
if(num==K)
{
// cout<<"here: "<<head<<" "<<a[head]<<" "<<vis[a[head]]<<Endl;
while((a[head]>=1&&a[head]<=K&&vis[a[head]]>1)||a[head]<1||a[head]>K)
{
// cout<<"abs"<<Endl;
if(a[head]>=1&&a[head]<=K&&vis[a[head]]>1) vis[a[head]]--;
++head;
}
// cout<<tail<<" "<<head<<Endl;
ans=min(ans,tail-head+1);
}
}
}
cout<<"Case "<<cases<<": ";
if(ans!=maxn) cout<<ans<<Endl;
else cout<<"sequence nai"<<Endl;
return ;
}
int main() {
for(int T = read(); T; T--)
{
cases++;
solve();
}
return 0;
}