BZOJ3173 [Tjoi2013]最长上升子序列
来源:互联网 发布:类似音悦台的软件 编辑:程序博客网 时间:2024/06/03 22:36
[Solution]
It seems to be a abnormal data structure problem? In fact, it is not. We can easily find that answer to i = k doesn't change if you insert a number bigger than k. Therefore, you only need to get the final sequence. Then work out the LIS length of each k. Max(f[1..k]) is the answer to k.
For me, as a lazy guy, I used vector to work it out although it is very very slow.
[Code]
#include <cstdio>#include <memory.h>#include <vector>#include <algorithm>using namespace std;const int maxn = 100009;int n, f[maxn], t[maxn];vector <int> x;void btChg(int* t, int p, int v) {while (p < maxn)t[p] = max(t[p], v), p += (p & -p);}int btQry(int* t, int p) {int s = 0;while (p)s = max(s, t[p]), p -= (p & -p);return s;}int main() {memset(t, 0, sizeof(t));scanf("%d", &n);for (int i = 0; i < n; i ++) {int p;scanf("%d", &p);x. insert(x. begin() + p, i + 1);}for (vector <int> :: iterator i = x. begin(); i != x. end(); i ++) {f[*i] = btQry(t, *i) + 1;btChg(t, *i, f[*i]);}f[0] = 0;for (int i = 1; i <= n; i ++)f[i] = max(f[i - 1], f[i]), printf("%d\n", f[i]);}
0 0
- BZOJ3173 [Tjoi2013]最长上升子序列
- [bzoj3173][TJOI2013]最长上升子序列
- 【bzoj3173】: [Tjoi2013]最长上升子序列
- bzoj3173【TJOI2013】最长上升子序列
- bzoj3173: [Tjoi2013]最长上升子序列
- BZOJ3173: [Tjoi2013]最长上升子序列
- 【bzoj3173】[Tjoi2013]最长上升子序列
- bzoj3173: [Tjoi2013]最长上升子序列
- BZOJ3173 [Tjoi2013]最长上升子序列
- 【bzoj3173】[Tjoi2013]最长上升子序列 Treap
- bzoj3173: [Tjoi2013]最长上升子序列
- BZOJ3173 TJOI2013最长上升子序列(Treap+ZKW线段树)
- bzoj3173 [Tjoi2013]最长上升子序列 dp Treap
- BZOJ3173: [Tjoi2013]最长上升子序列 Treap 平衡树
- BZOJ3173: [Tjoi2013]最长上升子序列 Treap+树状数组
- 【bzoj3173】【Tjoi2013】【最长上升子序列】treap+dp二分优化
- BZOJ3173 [Tjoi2013]最长上升子序列(离线处理+Treap+LIS)
- BZOJ3173[最长上升子序列] Treap+LIS
- 关于Gridview中的自动编号
- 八十多分的手法士大夫士大夫
- 关于 视频同步vsync 信号在不同时钟域采样问题
- hashmap,使用iterator读取后顺序改变
- 字符串去空格问题(转)
- BZOJ3173 [Tjoi2013]最长上升子序列
- Java中的instanceof关键字
- OpenCV打开摄像头失败
- 虚函数与泛型的结合应用
- JAVA集合类
- BZOJ 1858 SCOI2010 序列操作 线段树
- java网络编程根据域名获取ip地址,URL
- 匹配IP字串、域名的正则表达式
- 面试基础知识