UVA - 10913 Walking on a Grid

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXN 76
#define MAXK 6
using namespace std;
int n,k;
int s[MAXN][MAXN],dp[MAXN][MAXN][MAXK],vis[MAXN][MAXN][MAXK];

void init(){
memset(vis,0,sizeof(vis));
int count=0,all=0;
for(int i=n;i>=1;i--){
if(s
[i]<0)
count++;
if(count>k)
break;
all+=s
[i];
dp
[i][count]=all;
vis
[i][count]=1;
}
}

int main(){
int cases=1;
while(cin>>n>>k&&n+k){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>s[i][j];
init();
for(int i=n-1;i>=1;i--){
int count,all;
for(int j=1;j<=n;j++){
count=0,all=0;
for(int t=j;t>=1;t--){
if(s[i][t]<0)count++;
if(count>k)break;
all+=s[i][t];
for(int p=0;p+count<=k;p++){
if(vis[i+1][t][p]){
if(vis[i][j][p+count])
dp[i][j][p+count]=max(dp[i][j][p+count],dp[i+1][t][p]+all);
else{
dp[i][j][p+count]=dp[i+1][t][p]+all;
vis[i][j][p+count]=1;
}
}
}
}
count=0,all=0;
for(int t=j;t<=n;t++){
if(s[i][t]<0)count++;
if(count>k)break;
all+=s[i][t];
for(int p=0;p+count<=k;p++){
if(vis[i+1][t][p]){
if(vis[i][j][p+count])
dp[i][j][p+count]=max(dp[i][j][p+count],dp[i+1][t][p]+all);
else{
dp[i][j][p+count]=dp[i+1][t][p]+all;
vis[i][j][p+count]=1;
}
}
}
}
}
}
int flag=0,ans;
for(int i=0;i<=k;i++){
if(vis[1][1][i]){
if(flag==0)
ans=dp[1][1][i];
else
ans=max(ans,dp[1][1][i]);
flag=1;
}
}
cout<<"Case "<<cases++<<": ";
if(flag)
cout<<ans<<endl;
else
cout<<"impossible"<<endl;
}
return 0;
}