luogu3627&bzoj4990 [USACO17FEB]Why Did the Cow Cross the Road II P

http://www.elijahqi.win/archives/1406
题目描述

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 acceptable if the breeds are friendly, a property that turns out to be easily characterized in terms of breed ID: breeds aaa and bbb are friendly if ∣a−b∣≤4|a - b| \leq 4∣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 NNN fields on both sides of the road through FJ’s farm (again, with exactly one field for each breed on each side), please help FJ determine the maximum number of crosswalks he can draw over his road, such 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个点组成的一条直链，点带有点权且每条直链的点权为1-n的排列，你可以随意设置每个链中点排列的顺序，现在要求你在两个链中连线

两个点能连线需满足：

在不同的链上
不与前面的线交叉
点权差值小于等于4
一个点只能连一条线
求最大可能连线数

输入输出格式

输入格式：

The first line of input contains NNN (1≤N≤100,0001 \leq N \leq 100,0001≤N≤100,000). The next NNN 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…N1 \ldots N1…N. The last NNN 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.

输出格式：

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

输入输出样例

输入样例#1： 复制

6
1
2
3
4
5
6
6
5
4
3
2
1
输出样例#1： 复制

5
说明

感谢@Adscn提供题意简述

这题 设我们的dp方程以做到第i个划分状态 j表示现在做到第i个我最远连到了第二行pos位置的最大条数是多少 x

首先啊 我们预处理出我们i这个位置 和它相差在4以内点的position分别在哪里 然后

我每次转移更新状态的时候枚举我这次 最远连到哪里 然后倒着做就可以省一维空间 每次找最远的之前即pos-1这个位置在前1~i-1种状态中的最大值 (用树状数组维护

#include<cstdio>
#include<algorithm>
#include<vector>
#define N 110000
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while (ch<'0'||ch>'9') {if (ch=='-')f=-1;ch=gc();}
    while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
    return x*f;
}
int s[N],a[N],dp[N],n;
vector<int> b[N];
inline void add(int x,int v){
    while (x<=n){if (s[x]>=v) return;s[x]=v;x+=x&(-x);}
}
inline int query(int x){
    int tmp=0;
    while(x){tmp=max(tmp,s[x]);x-=x&(-x);}
    return tmp;
}
int main(){
    freopen("3657.in","r",stdin);
    n=read();
    for (int i=1;i<=n;++i) a[i]=read();
    for (int i=1;i<=n;++i){
        int x=read();
        for (int j=x-4;j<=x+4;++j){
            if (j<1||j>n)continue;
            b[j].push_back(i);
        }
    }
    for (int i=1;i<=n;++i){
        for (int j=b[a[i]].size()-1;j>=0;--j){
            dp[b[a[i]][j]]=query(b[a[i]][j]-1)+1;
            add(b[a[i]][j],dp[b[a[i]][j]]);
        }
    }
    printf("%d",query(n));
    return 0;
}