配列の中の最長の増分のサブシーケンスを求めます

/*
* Copyright (c) 2011 alexingcool. All Rights Reserved.
*/
#include <iostream>
#include <iterator>
#include <algorithm>

#define DEBUG
#undef DEBUG

using namespace std;

#define INF 65535

int array[] = {3, 2, 1, 2, 3};
const int size = sizeof array / sizeof *array;

int findLongestIncrement(int *array, int size)
{
	if (array == NULL || size <= 0)
		return -1;

	int *minValue = new int[size + 1];
	int maxLen = 1;
	minValue[1] = *array;
	for (int i = 1; i < size; i++)
	{
		int j;
		for (j = maxLen; j >= 1; j--)
		{
			if (array[i] < minValue[j])
				;
			else
				break;
		}

		if (j == maxLen)
		{
			maxLen = j + 1;
			minValue[j + 1] = array[i];
		}
		else
		{
			if (minValue[j + 1] > array[i])
				minValue[j + 1] = array[i];
		}
	}

	delete[] minValue;
	return maxLen;
}

void main()
{
	int ret = findLongestIncrement(array, size);
	cout << "ret = " << ret << endl;
}