查询序列中的最长递增子序列的长度

 

 

int FindMaxSS(int* list, int n)
{
	if( 0 >= n)
	{
		return 0;
	}
	if( 1 == n)
	{
		return 1;
	}
	int * maxv = new int[n];
	
	int* maxL = new int[n];
	for(int i = 0;i<n; ++i)
	{
		maxv[i] = 0;
		maxL[i] = 1;
	}
	maxv[0] = list[0];

	int maxvalue =1;
	int m = 0;
	for(int i =1; i < n; ++i)
	{
		for(int j = 0; j < i; ++j)
		{
			if(maxv[j] < list[i])
			{
				maxv[j] = list[i];
				maxL[j]++;
				if(maxL[j] > maxvalue )
				{
					maxvalue = maxL[j];
				}
			}

		}
	}
	delete [] maxv;
	maxv =NULL;
	delete [] maxL;
	maxL = NULL;
	
	return maxvalue;
}

 

 

第二种方法

 

int FindMaxSSEx(int* list, int n)  
{  
	if( 0 >= n)  
	{  
		return 0;  
	}  
	if( 1 == n)  
	{  
		return 1;  
	}  
	int * maxv = new int[n];  

	int* maxL = new int[n];  
	for(int i = 0;i<n; ++i)  
	{  
		maxv[i] = 0;  
		maxL[i] = 0;  
	}  
	maxv[0] = list[0];  
	maxL[0] = 1;

	int m = 0;  
	for(int i = 1; i < n; ++i)  
	{  
		for(int j = m; j >= 0; --j)  
		{  
			if(maxv[j] <= list[i])  
			{  
				if(maxL[j + 1] == 0)
				{
					m = j+1;  
					maxL[j + 1] = 1;
					maxv[j + 1] = list[i];
				}
				else if(maxv[j + 1] > list[i])
				{
					maxv[j + 1] = list[i];
				}
			}  
		}  
		if(maxv[0] > list[i])
		{
			maxv[0] = list[i];
		}

	}  
	delete [] maxv;  
	maxv =NULL;  
	delete [] maxL;  
	maxL = NULL;  

	return m + 1;  
}