#PU721. USACO 2017 February Contest, Platinum — Problem 2. Why Did the Cow Cross the Road II

    ID: 1372 传统题 文件IO:nocross 2000ms 256MiB 尝试: 0 已通过: 0 难度: 省选/NOI- 上传者: 标签>USACO赛事:feb17来源:usaco.orgscoring:equal_test_cases双指针单调栈

USACO 2017 February Contest, Platinum — Problem 2. Why Did the Cow Cross the Road II

USACO 2017 February Contest, Platinum — Problem 2. Why Did the Cow Cross the Road II

题目描述

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 aa and bb are friendly if ∣a−b∣≤4|a - b| \leq 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 NN 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).

输入格式

The first line of input contains NN (1≤N≤100,0001 \leq N \leq 100,000). The next NN 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 N. The last NN 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
5
Problem credits: Brian Dean