liangzihao1的博客

博客内容为本人独创,若有相似,纯属意外。

codeforces 261D Maxim and Increasing Subsequence dp+树状数组

题目网址: 洛谷大意: 给你一个数列b,和一个数t,构造出一个数列a为t个数列b组成的数列。 比如:b={3,2,1},t=2;a={3,2,1,3,2,1}。 有k组数据,数列中元素大小为[0,maxb] 求数列a的最长上升子序列(严格单调)。分析: 观察样例与数据可以知道,当t&g...

2018-03-24 12:21:31

阅读数:32

评论数:1

bzoj jzoj 3945. 【湖南省队集训2014】Jabberwocky 树状数组

Description Input Output Sample Input 1 10 3 1 2 3 2 1 1 2 4 2 3 5 3 4 4 2 5 1 2 6 3 1 6 7 1 7 2 3 9 4 2 Sample Output 5Data Const...

2018-02-08 15:05:42

阅读数:35

评论数:0

poj 3378 pascal

Description These days, Sempr is crazed on one problem named Crazy Thair.Given N (1 ≤ N ≤ 50000) numbers, which  are nomore than 109, Crazy Thair is ...

2016-05-30 20:50:15

阅读数:201

评论数:2

poj 3321

Description There is an apple tree outside of kaka'shouse. Every autumn, a lot of apples will grow in the tree. Kaka likes applevery much, so he has...

2016-05-26 16:36:38

阅读数:253

评论数:3

提示
确定要删除当前文章?
取消 删除
关闭
关闭