计蒜客NOIP2017提高组模拟赛（三）day2-小区划分

传送门

dp，注意边界

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<vector>
#define INF 0x7f7f7f7f
#define pii pair<int,int>
#define ll long long
#define MAXN 805 
using namespace std;

int read(){
    int x=0,f=1;char 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 n,k;
double f[MAXN][85];
double sumA[MAXN],sumB[MAXN];
double cost(int x,int y){
    return fabs((sumA[y]-sumA[x-1])-(sumB[y]-sumB[x-1]));
}
int main()
{
//    freopen("data.in","r",stdin);
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
        double t;scanf("%lf",&t);
        sumA[i]=sumA[i-1]+t;
    }
    for(int i=1;i<=n;i++){
        double t;scanf("%lf",&t);
        sumB[i]=sumB[i-1]+t;
    }
    for(int i=1;i<=k;i++){
        f[0][i]=-10000000;
    }
    for(int i=1;i<=n;i++){
        f[i][0]=-10000000;
    }
    f[0][0]=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            for(int q=0;q<i;q++){
                f[i][j]=max(f[i][j],f[q][j-1]+cost(q+1,i));
            }
        }
    }
    printf("%.6f
",f[n][k]);
    return 0;
}