【luoguCF261D】【CF261D】【树状数组】Maxim and Increasing Subsequence

传送门

题目描述

Maxim loves sequences, especially those that strictly increase. He is wondering, what is the length of the longest increasing subsequence of the given sequence $a$?

Sequence $a$ is given as follows:

the length of the sequence equals $n\times t$;
$(1<=i<=n\times t)$ , where operation means taking the remainder after dividing number $x$ by number $y$ .

Sequence $s_1,s_2,...,s_r$ of length $r$ is a subsequence of sequence $a_1,a_2,...,a_n$​ , if there is such increasing sequence of indexes $i_1,i_2,...,i_r$ ($1<=i_1$<$i_2$<$...$<$i_r<=n$) , that $a_{ij}=s_j$ . In other words, the subsequence can be obtained from the sequence by crossing out some elements.

Sequence $s_1,s_2,...,s_r$​ is increasing, if the following inequality holds: $s_1$<$s_2$<$...$<$s_r$ .

Maxim have $k$ variants of the sequence $a$ . Help Maxim to determine for each sequence the length of the longest increasing subsequence.

输入格式

The first line contains four integers $k$ , $n$ ,$maxb$ and $t$ $(1<=k<=10; 1<=n,maxb<=10^{5}; 1<=t<=10^{9}; n×maxb<=2·10^{7}) $ . Each of the next $k$ lines contain $n$ integers $b_1,b_2,...,b_n(1<=b_i<=maxb)$ .

Note that for each variant of the sequence $a$ the values $n$ , $maxb$ and $t$ coincide, the only arrays $b$ s differ.

The numbers in the lines are separated by single spaces.

输出格式

Print $k$ integers — the answers for the variants of the sequence $a$ . Print the answers in the order the variants follow in the input.

题意翻译

给你一个长度为$n$的$B$数组,$A$表示$B$数组复制$t$遍后首尾相连后的数组,求$A$的最长上升子序列 有$k$组询问 $maxb$表示$B$数组中最大的数

输入输出样例

输入 #1

3 3 5 2
3 2 1
1 2 3
2 3 1

输出 #1

2
3
3

---

解题思路

树状数组中存的是一定包括当前数的最长递增序列长度

---

Code

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int k,n,maxb,t,ans,sum;
int a[100100],tree[100100],f[100100],b[20000100];
int lowbit (int x)
{
	return x & (-x);
}
int find (int x)
{
	int ans=0;
	for (; x>0; x-=lowbit(x))
	      ans = max (ans, tree[x]);
	return ans;
}
void change (int x, int s)
{
	for (; x <= maxb; x+=lowbit (x))
	      tree[x] = max(tree[x], s);
}
int main()
{
	scanf ("%d%d%d%d", &k, &n, &maxb, &t);
	while (k--)
	{
		sum = 0;
		for (int i = 1; i <= n; i++)
		{
			scanf("%d", &a[i]);
			if (b[a[i]] != k+1)
			    sum++;
			b[a[i]] = k+1;
		}
		if (sum < t)//t是复制t遍，如果数的数量大于t，那么就表明序列中的数都可以选，直接输出序列有多少数
		{
			printf ("%d\n", sum);
			continue;
		}
		int ans = 0;
		memset (f, 0, sizeof (f));
		memset (tree, 0, sizeof (tree));
		for (int i = 1; i <= t; i++)
		    for (int j = 1; j <= n; j++)
		    {
		    	int x=find (a[j]-1)+1;//必须是递增，所以是求a[j]-1的最长递增序列长度，序列长度加上当前数（+1）
		    	if (f[j] < x)
		    	{
		    		f[j] = x;
		    		ans = max (ans, x);
		    		change (a[j],x);//加入树状数组
		    	}
		    	if (ans >= sum)
				   break;
		    }
		printf ("%d\n", ans);
	}
}

---