Poj 1163 題解

打完後編譯都沒編譯直接acv.

Code:

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int a[1100][1100],n;
int f[1100][1100];
void Input()
{
  scanf("%d",&n);
  for(int i=1;i<=n;i++)
  {
    for(int j=1;j<=i;j++)
	  scanf("%d",&a[i][j]);
  }
}
void Solve()
{
  for(int i=n;i>=1;i--)
    for(int j=1;j<=i;j++)
	  f[i][j]=max(f[i+1][j],f[i+1][j+1])+a[i][j];
}
void Output()
{
  printf("%d\n",f[1][1]);
}
int main()
{
  freopen("a.in","r",stdin);
  freopen("a.out","w",stdout);
  Input();
  Solve();
  Output();
  return 0;
}