BZOJ 4990: [Usaco2017 Feb]Why Did the Cow Cross the Road II 树状数组优化LCS

最新推荐文章于 2022-05-14 22:30:04 发布

BlackJack_

最新推荐文章于 2022-05-14 22:30:04 发布

阅读量428

点赞数

分类专栏： —————————dp LIS/LCS

本文链接：https://blog.csdn.net/BlackJack_/article/details/77477045

版权

—————————dp 同时被 2 个专栏收录

100 篇文章 0 订阅

订阅专栏

LIS/LCS

8 篇文章 0 订阅

订阅专栏

4990: [Usaco2017 Feb]Why Did the Cow Cross the Road II

Time Limit: 10 Sec Memory Limit: 128 MB
Submit: 20 Solved: 9
[Submit][Status][Discuss]

Description

Farmer John is continuing to ponder the issue of cows crossing the road through his farm, introduced in the preceding problem. He realizes that interaction between some pairs of breeds is actually acc eptable if the breeds are friendly, a property that turns out to be easily characterized in terms of breed ID: breeds aa and bb are friendly if |a-b|≤4, and unfriendly otherwise. It is ok for cows to wander into fields designated for other breeds, as long as they are friendly.Given the ordering of N fields on both sides of the road through FJ's farm (again, with exactly one field for each breed o n each side), please help FJ determine the maximum number of crosswalks he can draw over his road, s uch that no two intersect, and such that each crosswalk joins a pair of fields containing two breeds that are friendly. Each field can be accessible via at most one crosswalk (so crosswalks don't meet at their endpoints).

上下有两个长度为n、位置对应的序列A、B，

其中数的范围均为1~n。若abs(A[i]-B[j]) <= 4，

则A[i]与B[j]间可以连一条边。现要求在边与边不相交的情况下的最大的连边数量。

n <= 10^5。

Input

The first line of input contains N (1≤N≤100,0000).

The next N lines describe the order, by breed ID, of fields on one side of the road;

each breed ID is an integer in the range 1…N

The last N lines describe the order, by breed ID, of the fields on the other side of the road.

Each breed ID appears exactly once in each ordering.

Output

Please output the maximum number of disjoint "friendly crosswalks" Farmer John can draw across the road.

Sample Input

6
1
2
3
4
5
6
6
5
4
3
2
1

Sample Output

作为4993的加强版

数据范围扩大到了1e5

我们的目标仍然是求LCS

考虑对O(n^2)dp的优化

每次选择最大的，所以树状数组维护前缀最大值就好了

#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<set>
#include<map>
using namespace std;

typedef long long ll;

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
void print(int x)
{if(x<0)x=-x,putchar('-');if(x>=10)print(x/10);putchar(x%10+'0');}

const int N=100100;

int n,a[N],b[N],bit[N],now[N];

inline void modify(int x,int val)
{for(;x<=n;x+=(x&-x))if(bit[x]>val)break;else bit[x]=val;}

inline int query(int x)
{int res=0;for(;x;x-=(x&-x))res=max(res,bit[x]);return res;}

int main()
{
	n=read();
	register int i,j;
	for(i=1;i<=n;++i)a[i]=read();
	for(i=1;i<=n;++i)b[read()]=i;
	for(i=1;i<=n;++i)
	{
		for(j=max(1,a[i]-4);j<=min(n,a[i]+4);++j)now[j]=query(b[j]-1);
		for(j=max(1,a[i]-4);j<=min(n,a[i]+4);++j)modify(b[j],now[j]+1);
	}
	print(query(n));puts("");
	return 0;
}
/*
6
1 2 3 4 5 6
6 5 4 3 2 1

5
*/