Wannafly挑战赛12

A 银行存款

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

double dp[25];
int main()
{
    int n;
    double r[6];
    scanf("%d",&n);
    scanf("%lf",&r[1]);
    scanf("%lf",&r[2]);
    scanf("%lf",&r[3]);
    scanf("%lf",&r[5]);
    dp[0] = 1.0;
    for(int i = 1;i <= n;i++){
        if(i >= 1)
            dp[i] = max(dp[i],dp[i-1]*(1+r[1]));
        if(i >= 2)
            dp[i] = max(dp[i],dp[i-2]*pow(1+r[2],2));
        if(i >= 3)
            dp[i] = max(dp[i],dp[i-3]*pow(1+r[3],3));
        if(i >= 5)
            dp[i] = max(dp[i],dp[i-5]*pow(1+r[5],5));
        //printf("%.5f\n",dp[i]);
    }
    printf("%.5f\n",dp[n]);
}

B T95要减肥

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

const int N = 1000005;
long long a[N],b[N];
int main()
{
    long long n,m;
    scanf("%lld%lld",&n,&m);
    for(int i = 1;i <= n;i++)
        scanf("%lld",&a[i]);
    for(int i = 1;i <= n;i++)
        scanf("%lld",&b[i]);
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    long long maxn = 0,sum = 0;
    for(int i = 1;i <= n;i++){
        if(i % 3 == 0)
            sum += m;
        sum += b[n-i+1] - a[i];
        maxn = max(maxn,sum);
    }
    printf("%lld\n",maxn);
    return 0;
}

C 删除子串

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

const int N = 100005;
char str[N];
int dp[N][15][2];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    scanf(" %s",str+1);
    for(int i= n;i >= 1;i--)
        for(int j = 0;j <= m;j++)
            for(int k = 0;k < 2;k++)
            {
                dp[i][j][k] = max(dp[i][j][k],dp[i+1][j][k]);
                int kk = str[i] - 'a';
                int jj = j + (k != kk);
                if(jj <= m)
                    dp[i][jj][kk] = max(dp[i][jj][kk],dp[i+1][j][k]+1);
            }
    int maxn = 0;
    for(int i = 0;i <= m;i++)
        maxn = max(maxn,dp[1][i][0]);
    printf("%d\n",maxn);
    return 0;
}

好久没写题发现已经意识模糊了