Cod sursa(job #2282066)

Utilizator teodor345RosioruTeodor teodor345 Data 13 noiembrie 2018 09:46:59
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.53 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sumtri.in");
ofstream g("sumtri.out");
int a[101][101],x[101][101],n,i,j,mx;
int main()
{f>>n;

for(i=1;i<=n;i++)
{
   for(j=1;j<=i;j++)
   {

        f>>a[i][j];

   }
}
for(j=1;j<=n;j++)
    x[n][j]=a[n][j];
for(i=n-1;i>=1;i--)
{
    for(j=1;j<=i;j++)
    {
    if(x[i+1][j]>x[i+1][j+1])
    {
        x[i][j]=a[i][j]+x[i+1][j];
    }
    else
    {
        x[i][j]=a[i][j]+x[i+1][j+1];
    }
    }
}
g<<x[1][1];

    return 0;
}