#include <iostream>
using namespace std;
int a[4][4] = {1, 0, 0, 0, 3, 2, 0, 0, 4, 10, 1, 0, 4, 3, 2, 20};
int max(int x, int y)
{
return (x > y) ? x : y;
}
int d(int i, int j)
{
return a[i][j] + (i == 3 ? 0 : max(d(i + 1, j), d(i + 1, j + 1)));
}
int main()
{
cout << d(0, 0);
return 0;
using namespace std;
int a[4][4] = {1, 0, 0, 0, 3, 2, 0, 0, 4, 10, 1, 0, 4, 3, 2, 20};
int max(int x, int y)
{
return (x > y) ? x : y;
}
int d(int i, int j)
{
return a[i][j] + (i == 3 ? 0 : max(d(i + 1, j), d(i + 1, j + 1)));
}
int main()
{
cout << d(0, 0);
return 0;
}
#include <iostream>
using namespace std;
int a[5][5] = {0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 2, 0, 0, 0, 4, 10, 1, 0, 0, 4, 3, 2, 20};
int d[5][5];
int max(int x, int y)
{
return (x > y) ? x : y;
}
int main()
{
int i = 0, j = 0;
for(j = 1; j <= 4; j++)
{
d[4][j] = a[4][j];
}
for(i = 4 - 1; i >= 1; --i)
{
for(j = 1; j <= i; j++)
{
d[i][j] = a[i][j] + max(d[i + 1][j], d[i + 1][j + 1]);
}
}
cout << d[1][1] << endl;
return 0;
}