Dynamic Programming - Largest Increasing Subsequence

#include <bits/stdc++.h>
using namespace std;
int n,m[1001],len[1001],ans;
int main() {
    cin>>n;
    for (int i=1;i<=n;i++)
        cin>>m[i];
    for (int i=1;i<=n;i++) {
        len[i] = 1;
        for (int j=1;j<i;j++) {
            if (m[i] > m[j]) {
                len[i] = max(len[j]+1,len[i]);
                ans = max(ans,len[i]);
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}