paste bin

malic
C++
#include <cstdio>
#include <algorithm>
using std::max;

int main(void)
{
    int **a;
    int i,j,N;
    scanf("%d",&N);
    a=new int* [N];
    for(i=0;i<N;i++)
        a[i]=new int [i];
    for(i=0;i<N;i++)
    {
        for(j=0;j<=i;j++)
            scanf("%d",&a[i][j]);
    }


    for(i=N-2;i>=0;i--)
    {
        for(j=0;j<=i;j++)
        {
            a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
        }
    }

    printf("%d\n",a[0][0]);

    for(i=0;i<N;i++)
        delete [] a[i];
    delete [] a;
    return 0;
}

2019 C2QD

fork this code