Maximum Sequence HDU 6047 单调队列 思维题 寒假集训

Steph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the next number? Steph always finds them too easy for such a genius like himself until one day Klay comes up with a problem and ask him about it.

Given two integer sequences {ai} and {bi} with the same length n, you are to find the next n numbers of {ai}: an+1…a2n. Just like always, there are some restrictions on an+1…a2n: for each number ai, you must choose a number bk from {bi}, and it must satisfy ai≤max{aj-j│bk≤j<i}, and any bk can’t be chosen more than once. Apparently, there are a great many possibilities, so you are required to find max{∑2nn+1ai} modulo 109+7 .

Now Steph finds it too hard to solve the problem, please help him.
Input
The input contains no more than 20 test cases.
For each test case, the first line consists of one integer n. The next line consists of n integers representing {ai}. And the third line consists of n integers representing {bi}.
1≤n≤250000, n≤a_i≤1500000, 1≤b_i≤n.
Output
For each test case, print the answer on one line: max{∑2nn+1ai} modulo 109+7。
Sample Input
4
8 11 8 5
3 1 4 2
Sample Output
27

Hint
For the first sample:

1. Choose 2 from {bi}, then a_2…a_4 are available for a_5, and you can let a_5=a_2-2=9;
2. Choose 1 from {bi}, then a_1…a_5 are available for a_6, and you can let a_6=a_2-2=9;
   我们带着一个差分前缀和的思想，在输入a[i]的时候减去当前i的位置进行预处理，这样留下来的数字就是我选择b[i]后能出现的数字。
   然后将a[i]表示为i位置后能形成最大的新的数字，将b数组进行排序，并且在b1处令ans为可以产生的最大值，再在每个b[i]对应的位置上比较当前a[i]能产生的最大值和ans的关系，产生新的最大值。
   其实通过长度为n+1可知，我能生成的第一个ans就是整个a数组中能产生的最大值，后面的更新值只会在a数组和ans中产生

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <vector>