动态规划--最长单调子序列问题

void main(void)
{
	int arr[] = {10,4,20,10,15,13};
	int dist[6];
	int path[6];
	int num = 6;
	int i = 0;

	for(i = 0; i < 6; i++)
	{
		dist[i] = 0;
		//-1表示前面没有元素了，用于回头求解的时候定界
		path[i] = -1;
	}

	for(i = 0; i < num; i++)
	{
		int temp = 0;
		int index = -1;

		for(int j = i - 1; j >= 0; j--)
		{
			if(arr[i] > arr[j] && dist[j] > temp)
			{
				temp = dist[j];
				index = j;
			}//if
		}//for

		dist[i] = temp + 1;
		path[i] = index;

	}//for

	//找到最大的那个值
	int max = 0;
	int maxIndex = -1;
	for(int m = 0; m < num; m++)
	{
		if(dist[m] > max)
		{
			max = dist[m];
			maxIndex = m;
		}
	}//for
	printf("最长单曾子序列的长度是%d.\n", max);

	while(path[maxIndex] != -1)
	{
		printf("%d->", arr[maxIndex]);
		maxIndex = path[maxIndex];
	}//while
	printf("%d\n", arr[maxIndex]);

}