[BJOI2019] 排兵布阵

题目

这个\(dp\)出在普及都算水题吧

直接背包，\(O(nms)\)跑不满，非常稳

#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define re register
#define LL long long 
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
inline int read() {
    char c=getchar();int x=0;while(c<'0'||x>'9') c=getchar();
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+c-48,c=getchar();return x;
}
int n,m,s;
std::vector<int> v[105];
int dp[2][20005];
int main() {
    s=read(),n=read(),m=read();
    for(re int i=1;i<=s;i++) 
        for(re int j=1;j<=n;j++)
            v[j].push_back(read()*2);
    for(re int i=1;i<=n;i++)
        std::sort(v[i].begin(),v[i].end());
    memset(dp,-20,sizeof(dp));
    dp[0][0]=0;int o=0;
    for(re int i=1;i<=n;i++,o^=1) {
        for(re int j=0;j<=m;j++) dp[o^1][j]=dp[o][j];
        for(re int k=0;k<v[i].size();k++) {
            int t=v[i][k]+1;
            for(re int j=m;j-t>=0;j--)
                dp[o^1][j]=max(dp[o^1][j],dp[o][j-t]+(k+1)*i);
        }
        for(re int j=1;j<=m;j++)
            dp[o^1][j]=max(dp[o^1][j],dp[o^1][j-1]);
    }
    int ans=0;
    for(re int i=1;i<=m;i++) ans=max(ans,dp[o][i]);
    printf("%d\n",ans);
    return 0;
}

转载于:https://www.cnblogs.com/asuldb/p/10751229.html