r6

nlogn字符串找公共子串

#include<cstdio>
#include<cstring>
#include<iostream>
char a[1100000],b[1100];
int ans,dp[1100][1100],now[27],nex[1100000][26];//dp表示较短串匹配到i，长度为j，最近匹配到哪。nex表示第一个串最近的j字符
int main(){
    freopen("t1.in","r",stdin);
    freopen("t1.out","w",stdout);
    gets(a+1);int lena=strlen(a+1);
    gets(b+1);int lenb=strlen(b+1);
    for(int i=0;i<26;i++) now[i]=lena+1;
    for(int i=lena;i>=0;i--) {
        for(int j=0;j<26;j++) nex[i][j]=now[j];
        now[a[i]-'a']=i;
    }
    memset(dp,127/3,sizeof dp);
    dp[0][0]=0;
    for(int i=0;i<lenb;i++)
    for(int j=0;j<=i;j++)
        if(dp[i][j]<lena)   {
            dp[i+1][j]=std::min(dp[i][j],dp[i+1][j]);
            dp[i+1][j+1]=std::min(dp[i+1][j+1],nex[dp[i][j]][b[i+1]-'a']);

        }
    for(int i=1;i<=lenb;i++)
    ans=(dp[lenb][i]<=lena)?i:ans;
    printf("%d",ans);
}

t2

#include<cstdio>
#include <iostream> 
#include<algorithm>
#define l first
#define r second
#define p 1000000007
using namespace std;
int n,dp[2002][4100],m,nex[4100],j=1,ans;//nex是指，离i位置最近的区间j
//dp是指匹配到第i各区间，之前匹配到j的方案
pair <int,int> a[2100];
int main(){
    freopen("b.in","r",stdin);
    freopen("b.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d%d",&a[i].l,&a[i].r),m=max(m,a[i].r);
    sort(a+1,a+n+1);a[n+1].l=m+1;
    for(int i=1;i<=m;nex[i++]=j)
    while(j<=n+1&&a[j].l<=i) j++;
    for(int i=1;i<=n;i++){
        dp[i+1][a[i].r]++;
        for(int j=1;j<=m;j++)
        {
            dp[i+1][j]=(dp[i+1][j]+dp[i][j])%p;
            if(a[i].l<=j)   
                if(a[i].r<j) dp[nex[a[i].r]][j]=(dp[nex[a[i].r]][j]+dp[i][j])%p;
                else dp[nex[j]][a[i].r]=(dp[nex[j]][a[i].r]+dp[i][j])%p;
        }
    }
    for(int i=1;i<=m;i++)
    ans=(ans+dp[n+1][i])%p;
    printf("%d",ans);
} 

t3
暴力

#include<cstdio>
#define p 1000000007
int n,m;long long a[210000],s[210000],f[210000];int opt,l,r,z;
int main(){
    freopen("c.in","r",stdin);
    freopen("c.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]),s[i]=(s[i-1]+a[i])%p;
    while(m--){
        scanf("%d",&opt);
        if(opt==1) {scanf("%d%d%d",&l,&r,&z);for(int j=l;j<=n;j+=r) f[i]=(f[i]+z)%p;}
        else {
            scanf("%d%d",&l,&r);for(int i=1;i<=n;i++)printf("%lld\n",(s[r]-s[l-1]+p)%p);
        }
    }
}