hdu1257 最少拦截系统（longest increasing subsequeue）

参考了 http://www.wutianqi.com/?p=1850的分析，^ ^

#include<iostream>

#include<cstdio>
using namespace std;
int dp[1000];
int LIS(int arr[1000], int n)
{
int i;
for(i=1; i<=n; ++i)
dp[i] = 0;
int ans;
dp[1] = 1;
for(i=2; i<=n; ++i)
{
ans = dp[i];
for(int j=1; j<i; ++j)
{
if(arr[i]>arr[j] && dp[j]>ans)
ans = dp[j];
}
dp[i] = ans+1;
}
ans = 0;
for(i=1; i<=n; ++i)
{
cout<<dp[i]<<" ";
if(dp[i] > ans)
ans = dp[i];
}
cout<<endl;
return ans;
}
int main()
{
int n,arr[1000];
while(scanf("%d",&n)!=EOF)
{
for(int i=1;i<=n;i++)
cin>>arr[i];
int ans=LIS(arr,n);
cout<<ans<<endl;
}


}