poj 2533 && zoj 2136 Longest Ordered Subsequence --- LIS模板

zoj多输了个test。。

#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <cmath>#include <algorithm>#include <vector>#include <queue>#include <map>#define inf 0x3f3f3f3f#define ll __int64using namespace std;int a[1010],dp[1010],n,i,j,ans,t;int main(){    scanf("%d",&t);    while(t--)    {        scanf("%d",&n);        for(i=0;i<n;i++)            scanf("%d",&a[i]);        ans=0;        for(i=0;i<n;i++)        {            dp[i]=1;            for(j=0;j<i;j++)            {                if(a[j]<a[i]&&dp[j]+1>dp[i])                    dp[i]=dp[j]+1;            }            if(ans<dp[i]) ans=dp[i];        }        printf("%d\n",ans);        if(t) putchar('\n');    }    return 0;}