Largest increasing subset

gistfile1.cpp

#include <iostream>
#include <stdio.h>
#include <string>


using namespace std;


int main()
{
	int n;
	cin >> n;

	int integers[n];

	for (int i = 0; i < n; i++)
		cin >> integers[i];

	int j[n];//n

	for (int i = 0; i < n; i++){
		j[i] = 1;
		int max = 1;
		for (int h = 0; h < i; h++){
			if (integers[i] >= integers[h]){
				if (j[h] + 1 > max)
					max = j[h] + 1;
			}
		}
		j[i] = max;
	}
	cout << j[n - 1] << endl;
	return 0;
}