最長遞增子序列（包含路徑記錄）

#include <iostream>
#include <stack>
using namespace std;


#define MAX 999
#define BIG 101


int a[BIG];


void max_sum(int a[],int n)
{
int nowleng = 1;
int maxleng = 1;
int nowhead = 0;
int maxhead = 0;
int tail = 0;
int flag = 1;
for (int i = 1; i < n; i++)
{
if (flag == 1)
{
nowhead = i - 1;
flag = 2;
}
if (a[i] > a[i - 1])
{
nowleng++;
}
if (nowleng > maxleng)
{
maxleng = nowleng;
maxhead = nowhead;
tail = i;
}
if (a[i] <= a[i - 1])
{
nowleng = 1;
flag = 1;
}
}
if (maxleng == 1) cout << "不存在最大遞增子序列" << endl;
else cout << "最大遞增子序列長度爲：" << maxleng << endl << "路徑是：" << maxhead + 1 << "->" << tail+1 << endl;
}


int main()
{
int n;
while (cout << "輸入個數：",cin>>n)
{
memset(a, 0, sizeof(a));
cout << "輸入數值：";
for (int i = 0; i < n; i++) cin >> a[i];
max_sum(a, n);
getchar();
getchar();
    }
return 0;
}