ZOJ-2136 Longest Ordered subsequence

Compared to Hdoj's Fatmouse ' s speed, this problem only needs to output the length of the oldest sequence.

#include <iostream>using namespace std; #define Size 1000int Main () {        int N1;        int table[size+1];        int a[size+1];        cin>>n1;        for (int i=0; i<n1; i++)        {                int N2;                int ans=0;                cin>>n2;                for (int j=0; j<n2; j + +)                {                        cin>>a[j];                        Table[j]=1;                        for (int k=0; k<j; k++)                                if (A[j]>a[k] && table[j]<table[k]+1)                                    table[j]=table[k]+1;                        if (Table[j]>ans)                            ans = table[j];                }                if (i)                    cout<<endl;                cout<<ans<<endl;        }        return 0;}

　　

ZOJ-2136 longest Ordered subsequence