#include<iostream>

#include<cstdio>

#include<cstring>

#define maxn 100010

using namespace std;

int n;

long long a[maxn],ans,sum[maxn];

char s[maxn];

long long qread(){

    int i=,j=;

    char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')j=-;ch=getchar();}

    while(ch<=''&&ch>='')i=i*+ch-'',ch=getchar();

    return i*j;

}

int main(){

    freopen("maximum.in","r",stdin);freopen("maximum.out","w",stdout);

//    freopen("Cola.txt","r",stdin);

    scanf("%d",&n);

    for(int i=;i<=n;i++){

        a[i]=qread();

        sum[i]=sum[i-];

        if(a[i]>)sum[i]=sum[i-]+a[i];

    }

    scanf("%s",s+);

    long long c=;

    for(int i=n;i>=;i--)//枚举从哪一位开始

        if(s[i]==''){

            ans=max(ans,c+sum[i-]);

            c+=max(a[i],0LL);

        }

    ans=max(ans,c);

    cout<<ans;

}

#include<iostream>

#include<cstdio>

#include<cstring>

#define maxn 1010

using namespace std;

int n,k,a[maxn],pla[],cnt,b[maxn];

long long ans=;

int count(int x){

    int res=;

    while(x){

        if(x&)res++;

        x>>=;

    }

    return res;

}

bool pos[maxn];

long long Abs(long long x){

    if(x>=)return x;

    if(x<)return -x;

}

int main(){

    freopen("minimum.in","r",stdin);freopen("minimum.out","w",stdout);

//    freopen("Cola.txt","r",stdin);

    scanf("%d%d",&n,&k);

    for(int i=;i<(<<n);i++)

        if(count(i)==k)pla[++cnt]=i;

    for(int i=;i<=n;i++)scanf("%d",&a[i]);

    for(int i=;i<=cnt;i++){

        memset(pos,,sizeof(pos));

        int p=;

        int now=pla[i];

        while(now){

            p++;

            if(now&)pos[p]=;

            now>>=;

        }

        for(int j=;j<=n;j++){

            if(pos[j]==||j==)b[j]=a[j];

            else b[j]=b[j-];

        }

        long long sum=;

        for(int j=;j<=n;j++){

            sum=max(sum,Abs(b[j]-b[j-]));

        }

        ans=min(ans,sum);

    }

    cout<<ans;

}

/*

    二分两个数之间的差的最大值

    F[i]表示i不改变的最小修改的元素个数

    f[i]=min(f[j]+(i-j-1),i-1) abs(A[j]-A[i])<二分出来的答案*（i-j）

*/

#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cstdlib>

#define maxn 2010

using namespace std;

int n,k,a[maxn],f[maxn];

bool check(int x){

    f[]=;

    int ans=n;

    for(int i=;i<=n;i++){

        f[i]=i-;

        for(int j=;j<i;j++)

            if(abs(a[i]-a[j])<=1LL*x*(i-j))

                f[i]=min(f[i],f[j]+(i-j-));//假设改了(j~i)的数

        ans=min(ans,f[i]+n-i);//假设最后一个数改了

    }

    return ans<=k;

}

int main(){

    freopen("minimum10.in","r",stdin);

    scanf("%d%d",&n,&k);

    for(int i=;i<=n;i++)scanf("%d",&a[i]);

    int l=,r=,ans=;

    while(l<=r){

        int mid=(l+r)>>;

        if(check(mid))ans=mid,r=mid-;

        else l=mid+;

    }

    printf("%d",ans);

    return ;

}

#include<iostream>

#include<cstring>

#include<cstdio>

#define maxn 100010

using namespace std;

int n,X,Y,sum[maxn];

bool ok[][];

char s[maxn];

int Gcd(int x,int y){

    if(y==)return x;

    return Gcd(y,x%y);

}

int main(){

    freopen("sequence.in","r",stdin);freopen("sequence.out","w",stdout);

//    freopen("Cola.txt","r",stdin);

    scanf("%d%d%d",&n,&X,&Y);

    scanf("%s",s+);

    for(int i=;i<=n;i++){

        sum[i]=sum[i-];

        if(s[i]=='A')sum[i]=sum[i-]+;

    }

    for(int len=;len<=n;len++){//枚举长度

        for(int l=;l+len-<=n;l++){

            int r=l+len-;

            int cntA=sum[r]-sum[l-];

            int cntB=len-cntA;

            int g=Gcd(cntA,cntB);

            cntA/=g;cntB/=g;

            if(cntA==X&&cntB==Y)ok[l][r]=;

        }

    }

    int q;

    scanf("%d",&q);

    int l,r,ans;

    while(q--){

        scanf("%d%d",&l,&r);

        bool flag=;

        for(int len=r-l+;len>=;len--){

            for(int i=l;i+len-<=r;i++){

                int j=i+len-;

                if(ok[i][j]){

                    ans=len;

                    flag=;

                    break;

                }

            }

            if(flag)break;

        }

        printf("%d\n",ans);

    }

}

预计得分100++

实际得分100++

T1写了一个小时的数位dp，然后调不出来了，发现可以贪心，就写了贪心。T2T3看了没什么思路，T2前30分可以状压，T330分貌似爆搜就能过，可能代码写的丑

今天的暴力分都得的不全，希望能把暴力写的优美一点