#include<stdio.h> int max(int a,int b)
{
int c;
if(a>b)
c=a;
else
c=b; return c;
} int main()
{
FILE *fin,*fout;
int a[][],i,j; fin=fopen("in.txt","r");
fout=fopen("out.txt","w"); for(i=;i<=;i++)
for(j=;j<=;j++)
a[i][j]=; for(i=;i<=;i++)
for(j=;j<=i;j++)
fscanf(fin,"%d",&a[i][j]); for(;i>=;i--)
for(j=;j<=i;j++)
a[i][j]=max(a[i-][j],a[i-][j+]); fprintf(fout,"%d\n",a[][]); fclose(fin);
fclose(fout);
getchar();
getchar();
return ;
}
相关文章
- bzoj 1207: [HNOI2004]打鼹鼠【dp】
- BZOJ.1109.[POI2007]堆积木Klo(DP LIS)
- bzoj 1207: [HNOI2004]打鼹鼠 (dp)
- BZOJ 1492 [NOI2007]货币兑换Cash:斜率优化dp + cdq分治
- CodeForces 757D Felicity's Big Secret Revealed(状压DP)
- BZOJ 1260 [CQOI2007]涂色paint(区间DP)
- BZOJ 1492: [NOI2007]货币兑换Cash( dp + 平衡树 )
- 51Nod 1405 树的距离之和 (树dp)
- CodeForces1051E EXKMP + 线段树dp
- 【Gym - 101002F】Mountain Scenes(dp)