SPOJ: ELIS - Easy Longest Increasing Subsequence

#include <iostream>

using namespace std;

/**
Problem: http://www.spoj.com/problems/ELIS/
Author: GastonFontenla
Date: 26/05/2016
**/

int main()
{
    int n;
    cin >> n;
    int a[n], lis[n];
    for(int i=0; i<n; i++)
        cin >> a[i], lis[i] = 1;

    for(int i=1; i<n; i++)
        for(int j=0; j<i; j++)
            if(a[j] < a[i])
                lis[i] = max(lis[i], lis[j]+1);

    int maxV = 0;
    for(int i=0; i<n; i++)
        maxV = max(maxV, lis[i]);

    cout << maxV << endl;

    return 0;
}