Longest Increasing Subsequence

#include <cstdio>
using namespace std;
int main()
{
    int n;
    scanf("%d", &n);
    int * arr = new int[n], i, j, * len = new int[n], max;
    for(i = 0; i < n; i++) scanf("%d", &arr[i]);
    len[0] = 1;
    for(i = 1; i < n; i++)
    {
        max = 0;
        for(j = 0; j < i; j++) if(arr[i] > arr[j] && len[j] > max) max = len[j];
        len[i] = max + 1;
    }
    max = 0;
    for(i = 0; i < n; i++) if(len[i] > max) max = len[i];
    printf("%d", max);
    return 0;
}