题意:求最长递增子序列。
题目链接:http://poj.org/problem?id=2533
——>>……
woj - 1398 - Stock Exchange
题目链接:http://acm.whu.edu.cn/land/problem/detail?problem_id=1398
——>>两道题题意一样,不过这里的数量大了10倍,开始没改maxn,结果竟然是TLE,开多10倍的空间就AC啦~
hdu - 1257 - 最少拦截系统
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1257
——>>maxn改为30000 + 10~AC~
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 10000 + 10;
const int INF = 1000000000;
int a[maxn], d[maxn], g[maxn];
int main()
{
int N, i;
while(scanf("%d", &N) == 1)
{
int ret = -1;
for(i = 1; i <= N; i++) scanf("%d", &a[i]);
for(i = 1; i <= N; i++) g[i] = INF;
for(i = 1; i <= N; i++)
{
int k = lower_bound(g+1, g+1+N, a[i]) - g;
d[i] = k;
g[k] = a[i];
ret = max(ret, k);
}
printf("%d\n", ret);
}
return 0;
}