CF1433 F. Zero Remainder Sumt
题意:
问题分析:
没整明白,复习下dp在做做。。。。。
作者 / 出处
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<sstream>
#include<string.h>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
#define ll long long
#define lowbit(x) (x)&(-x)
#define mem(a,b) memset((a),(b),sizeof(a));
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
const ll inf=0x3f3f3f3f;//1061109567,2*未超int,allinf=mem(a,0x3f,sizeof(a));
typedef pair<int ,int > PII;
const int nn=1e6+10;
bool flag[nn];
int dp[75][75][40][75];
int a[75][75];
int main()
{
//#define io
#ifdef io
freopen("in.txt","r",stdin);
#endif
int n,m,k;
cin>>n>>m>>k;
forr(i,1,n)forr(j,1,m)cin>>a[i][j];
mem(dp,-inf);
dp[1][1][0][0]=0;
forr(i,1,n)forr(j,1,m)
{forr(cnt,0,m/2)forr(mod,0,k-1){
if(cnt!=m/2)
dp[i][j+1][cnt+1][(mod+a[i][j])%k]=
max(dp[i][j+1][cnt+1][(mod+a[i][j])%k],dp[i][j][cnt][mod]+a[i][j]);
dp[i][j+1][cnt][mod]=
max(dp[i][j+1][cnt][mod],dp[i][j][cnt][mod]);
}
if(j==m){
forr(cnt,0,m/2)forr(mod,0,k){
dp[i+1][1][0][mod]=
max(dp[i+1][1][0][mod],dp[i][j+1][cnt][mod]);
}
}
}
int maxx=0;
forr(i,0,m/2) maxx=max(maxx,dp[n][m+1][i][0]);
cout<<maxx<<endl;
return 0;
}