机测，新一代的三角

新数字三角形问题
#include <bits/stdc++.h>
using namespace std;
int pp[260][260], bb[260][260], n, x[260],y[260], k;
void DFS(int i, int j)
{
if(i  >= n || j > n) return;
else if(bb[i+1][j] >= bb[i+1][j+1])
{
i = i+1;
j = j;
x[k] = i;
y[k++] = j;
DFS(i, j);
}
else if(bb[i+1][j] < bb[i+1][j+1])
{
i = i+1;
j = j+1;
x[k] = i;
y[k++] = j;
DFS(i, j);
}
}
int main()
{
while(cin >> n)
{
k = 1;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= i; j++)
cin >> pp[i][j];
}
for(int i = 1; i <= n; i++)
bb
[i] = pp
[i];
for(int i = n-1; i >= 1; i--)
{
for(int j = 1; j <= i; j++)
{
pp[i][j] = max(pp[i+1][j], pp[i+1][j+1]) +pp[i][j];
bb[i][j] = pp[i][j];
}
}
cout << pp[1][1] << endl;
DFS(1, 1);
for(int i = k-1; i >= 1; i--)
{
cout << x[i] << ' ' << y[i] << endl;
}
cout << 1 << ' ' << 1 << endl;
}
return 0;
}