POJ-2533 裸LIS

紫书上的模板还真是好套呢，我的代码算是O(n3)的复杂度吧，不不，还是个O(n3)的算法

#include <cstdio>#include <cstring>#include <vector>#include <queue>#include <iostream>#include <cmath>#include <vector>#include <algorithm>using namespace std;#define DEBUGconst int maxn=1000+5,maxv=26,INF=0x3f3f3f3f;int n,d[maxn],a[maxn];int dp(int i){    int& ans=d[i];    if(d[i]>0)return ans;    ans=1;    for(int j=i+1;j<=n;j++){        if(a[j]>a[i]) ans=max(ans,dp(j)+1);    }    return ans;}int main(){#ifdef DEBUG    freopen("in.txt", "r", stdin);    freopen("out.txt", "w", stdout);#endif    cin>>n;    for(int i=1;i<=n;i++){        cin>>a[i];    }    int ans=0;    for(int i=1;i<=n;i++){        ans=max(ans,dp(i));    }    printf("%d\n",ans );#ifdef DEBUG    fclose(stdin);    fclose(stdout);#endif    return 0;}