题目:
#include<bits/stdc++.h>
#define INF 1e18
#define inf 1e9
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const int _max = 1005;
int dp[_max][_max];
int main(){
IOS;
int n,m,t;
cin>>t;
while(t--){
cin>>n>>m;
memset(dp,0,sizeof(dp));
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= m ; j++)
cin>>dp[i][j];
for(int i = 2 ; i <= n ; i++) dp[i][0] = -inf;
for(int j = 2 ; j <= m ; j++) dp[0][j] = -inf;
for(int i = 1 ; i <= n ; i++){
for(int j = 1 ; j <= m ; j++){
int val = max(dp[i][j-1],dp[i-1][j]);
for(int k = 1 ; k < j ; k++){
if(j%k != 0) continue;
val = max(val,dp[i][k]);
}
dp[i][j] += val;
}
}
/* for(int i = 1 ; i <= n ; i++){
for(int j = 1 ; j <= m ; j++)
cout<<dp[i][j]<<' ';
cout<<endl;
}*/
cout<<dp[n][m]<<endl;
}
return 0;
}
题目很简单我WA了很多次,忘记处理边界了。以后记着要考虑清楚来。最近都很不在状态。你要快点调整好你自己啊。