题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1257
题解:一道纯LIS题,下面是O(nlogn)的写法。
代码如下:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int dp[maxn], a[maxn];
int main()
{
int n, len;
while(scanf("%d",&n)!=EOF)
{
len = 0;
for(int i = 1; i<=n; i++)
scanf("%d",&a[i]);
dp[++len] = a[1];
for(int i = 2; i<=n; i++)
{
if(a[i]>=dp[len])
dp[++len] = a[i];
else
{
int pos = upper_bound(dp+1,dp+1+len,a[i]) - (dp+1);
dp[pos+1] = a[i];
}
}
printf("%d\n",len);
}
return 0;
}