LITTLE SHOP OF FLOWERS

#include<iostream>

#define FMAX 101

#define VMAX 101

#define INF 999

using namespace std;

int value[FMAX][VMAX];

int state[FMAX][VMAX];

int f,v;

int solve1(){

int i,j,k,tmp;

for(i=1;i<=v;i++)

state[1][i] = value[1][i];

for(i=2;i<=f;i++)

for(j=1;j<=v;j++){

if(i>j) {

state[i][j] = -INF;

continue;

}

tmp = -INF;

for(k=i-1;k<=j-1;k++)

if(state[i-1][k] > tmp) tmp = state[i-1][k];

state[i][j] = tmp + value[i][j];

}

tmp = -INF;

for(i=f;i<=v;i++){

if(tmp < state[f][i]) tmp = state[f][i];

}

return tmp;

}

 

int main(){

int i,j;

cin>>f>>v;

for(i=1;i<=f;i++)

for(j=1;j<=v;j++)

cin>>value[i][j];

cout<<solve1();

}