求最长等差数列

// 最长等差数列.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <vector>

using namespace std;

int max(int a, int b)
{
	if (a >= b)
		return a;

	return b;
}

int getMaxDengCha(int a[], int n)
{
	vector<vector<int> > dp(n, vector<int>(n));

	//dp[i][j] 表示以j为最后一个元素, i为倒数第二个元素的等差数列的最大等差数
	for (int i=0; i<n; i++)
	{
		dp[i][i] = 1;
	}

	for (int i=0; i<n; i++)
	{
		for (int j=i+1; j<n; j++)
		{
			dp[i][j] = 2;
		}
	}

	for (int i=0; i<n; i++)
	{
		
		for (int j=0; j<n; j++)
		{
			
			if (j>i)
			{
				for (int k=i-1; k>=0; k--)
				{
					if (a[i]-a[k] == a[j]-a[i])
					{
						dp[i][j] = max(dp[k][i]+1, dp[i][j]);
						break;
					}
				}
			}
		}
		
	}


	int max = 0;
	for (int i=0; i<n; i++)
	{
		for (int j=0; j<n; j++)
		{
			if (dp[i][j] > max)
			{
				max = dp[i][j];
			}
		}
	}

	return max;

}



int _tmain(int argc, _TCHAR* argv[])
{
	int a[] = {1,2,3,5,6,7,9,12};
	int ret = getMaxDengCha(a, sizeof(a)/sizeof(a[0]));

	printf("%d", ret);
	return 0;
}