hdu 1176免费的馅饼
#include"stdio.h"
#define N 13
#define M 100005
int a[N][M];
int b[N][M];
int main()
{
int i,j;
int n;
int k;
int hl,hm,hr;
int max;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
return 0;
k=0;
for(i=0;ihm?hl:hm;
max=max>hr?max:hr;
a[i][j]=max;
}
}
max=0;
for(i=1,j=k;i<=11;i++)
{
if(a[i][j]>max)
{
max=a[i][j];
}
}
printf("%d\n",max-1);
}
return 0;
}