1003.Maximum Sequence

Time Limit: 4000/2000 MS (Java/Others)	Memory Limit: 32768/32768 K (Java/Others)

Problem Description
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 {$a_i$} and {$b_i$} with the same length n, you are to find the next n numbers of {$a_i$}:$a_{n+1}…a_{2n}$. Just like always, there are some restrictions on $a_{n+1}…a_{2n}$: for each number ai, you must choose a number $b_k$ from {$b_i$}, and it must satisfy $a_i$≤max{$a_j-j | b_k ≤j< i$}, and any $b_k$ can’t be chosen more than once. Apparently, there are a great many possibilities, so you are required to find max{$\sum_{n+1}^{2n}a_i$} 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 {$a_i$}. And the third line consists of n integers representing {$b_i$}.
1≤n≤250000, n≤$a_i$≤1500000, 1≤$b_i$≤n.

Output
For each test case, print the answer on one line: max{$\sum_{n+1}^{2n}a_i$} 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 {$b_i$}, then $a_2…a_4$ are available for $a_5$, and you can let $a_5$=$a_2$-2=9;
2. Choose 1 from {$b_i$}, then $a_1…a_5$ are available for $a_6$, and you can let $a_6$=$a_2$-2=9;

找规律的题目

//AC: 624MS 5220k
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
const int mod=1e9+7;
using namespace std;
typedef long long LL;
int a[3000020];
int c[230005];
int b[250005];
int main()
{
    int n;
    int t=0;
    while(scanf("%d",&n)!=EOF){
        LL ans=0,sum=0;
        t++;
        if(t>20)
            break;
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&b[i]);
        sort(b+1,b+n+1);
        for(int i=n;i>0;i--){
            if(a[i]-i>=ans)
                ans=a[i]-i;
            c[i]=ans;
        }
        int max=-1;
        for(int i=1;i<=n;i++){
            if(c[b[i]]>max)
                a[n+i]=c[b[i]];
            else
                a[n+i]=max;
            if(a[n+i]-n-i>max)
                max=a[n+i]-n-i;
            sum+=a[n+i];
            if(sum>mod)
                sum%=mod;
        }
        printf("%lld\n",sum);
    }
    return 0;
}