Pagini recente » Cod sursa (job #1090375) | Cod sursa (job #2521495) | Cod sursa (job #1982919) | Cod sursa (job #317527) | Cod sursa (job #1957146)
#include <iostream>
#include <fstream>
using namespace std;
int n,a[20][20],s[20][20],p[20][20];
int i,j;
ifstream fin("matrice.in");
int main()
{
fin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=i;j++)
fin>>a[i][j];
for (i=1;i<=n;i++)
s[n][i]=a[n][i];
for (i=n-1;i>=1;i--)
for (j=1;j<=i;j++)
if (s[i+1][j]>s[i+1][j+1])
{
s[i][j]=a[i][j]+s[i+1][j];
p[i][j]=1;
}
else
{
s[i][j]=a[i][j]+s[i+1][j+1];
p[i][j]=2;
}
int q=1,r=1;
cout<<"Suma maxima= "<<s[1][1]<<"= "<<a[1][1]<<"+";
for (i=1,j=1;i<n;i++)
{
if (p[i][j]==2)
{
r=r+1;
j++;
}
q=q+1;
cout<<a[q][r]<<"+";
}
cout<<'\b'<<" "<<endl;
fin.close();
return 0;
}