题目链接:https://codeforces.ml/contest/1433/problem/F
题意:
给定n,m,k(大小1~70).
然后再输入n*m矩阵。
每一行最后选m/个,问怎样选能使最后的和最大(且还要ans%k==0)。
题解:
动态规划,mx[i][j]表示第i行模为j的最大值。
唉emmm,其他不多说了,找个时间系统刷一刷dp。
代码:
#include <bits/stdc++.h>
#define ll long long
#define pi acos(-1)
#define pb push_back
#define mst(a, i) memset(a, i, sizeof(a))
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp(x,y) make_pair(x,y)
#define dbg(x) cout << #x << "===" << x << endl
using namespace std;
template<class T>void read(T &x){T res=0,f=1;char c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}while(isdigit(c)){res=(res<<3)+(res<<1)+c-'0';c=getchar();}x=res*f;}
void print(ll x){if(x<0){putchar('-');x=-x;}if(x>9)print(x/10);putchar(x%10+'0');}
const ll maxn = 70 + 10;
const ll mod = 1e9 + 7;
ll n,m,k;
ll mx[maxn][maxn],a[maxn][maxn];
void solve(ll x){
static ll dp[maxn][maxn][maxn];
mst(dp,~0x3f);
dp[0][0][0]=0;
for(ll i=1;i<=m;i++){
memcpy(dp[i],dp[i-1],sizeof(dp[i]));
for(ll j=1;j<=m/2&&j<=i;j++){
for(ll k1=0;k1<k;k1++){
dp[i][j][(k1+a[x][i])%k]=max(dp[i][j][(k1+a[x][i])%k],dp[i-1][j-1][k1]+a[x][i]);
}
}
}
for(ll j=1;j<=m/2;j++){
for(ll k1=0;k1<k;k1++){
mx[x][k1]=max(mx[x][k1],dp[m][j][k1]);
}
}
}
ll solve1(){
static ll dp[maxn][maxn];
mst(dp,~0x3f);
dp[0][0]=0;
for(ll i=1;i<=n;i++){
memcpy(dp[i],dp[i-1],sizeof(dp[i]));
for(ll k1=0;k1<k;k1++){
for(ll k2=0;k2<k;k2++){
dp[i][(k1+k2)%k]=max(dp[i][(k1+k2)%k],dp[i-1][k2]+mx[i][k1]);
}
}
}
return dp[n][0];
}
//ll gcd(ll a,ll b){return (b==0)?a:gcd(b,a%b);}
//ll qpow(ll a,ll p,ll mod){ll ans=1;a=a%mod;while(p){if(p&1)ans=(ans*a)%mod;p>>=1;a=(a*a)%mod;}return ans;}
int main() {
ll _s = 1;
//read(_s);
for (ll _=1;_<=_s;_++) {
read(n),read(m),read(k);
for(ll i=1;i<=n;i++) for(ll j=1;j<=m;j++) read(a[i][j]);
mst(mx,~0x3f);
for(ll i=1;i<=n;i++){
solve(i);
}
ll ans=solve1();
cout<<ans<<endl;
}
return 0;
}
/*
input:::
output:::
*/