In what seems to be a familiar occurrence, Farmer John is lining up his N cows (1 < N < 105), conveniently numbered . N. for a photograph. Initially, the cows are lined up in the order a1, a2,..., aN from left to right. Farmer John's goal is to line up the cows in the order bi,..., by from left to right. To accomplish this, he may perform a series of modifications to the ordering. Each Copyright By PowCoder代写 加微信 powcoder
modification consists of choosing a single cow and moving it some number of positions to the left
Please count the minimum number of modifications required in order for Farmer John to line up his cows in the desired
INPUT FORMAT (input arrives from the terminal / stdin):
The first line of input contains V. The second line contains a1, a2,…,aN. The third line contains b1, ba,…,b.N.
OUTPUT FORMAT (print output to the terminal / stdout:
Print the minimum number of modifications required to produce Farmer John’s desired ordering.
SAMPLE INPUT:
SAMPLE OUTPUT:
In this example, the cows are already in the desired order, so no modifications are required
SAMPLE INPUT:
SAMPLE OUTPUT:
In this example, two modifications suffice. Here is one way Farmer John can rearrange his cows:
1. Choose cow 4 and move it four positions to the left
2. Choose cow 2 and move it two positions to the left
Test cases 3-6 satisfy N < 100.
Test cases 7-10 satisfy N < 5000
Test cases 11-14 satisfy no acditional constraints
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com