HDU 6047 Maximum Sequence

最新推荐文章于 2019-04-09 20:30:38 发布

小白菜小青菜

最新推荐文章于 2019-04-09 20:30:38 发布

阅读量219

点赞数

分类专栏： ACM_数学_规律_思维文章标签：水题

本文链接：https://blog.csdn.net/lihao161530340/article/details/76361645

版权

ACM_数学_规律_思维专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Maximum Sequence

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1534 Accepted Submission(s): 709

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 {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&lt；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,b，长度为n,让你构造a序列n+1~n*2的元素，有一个规则：
ai≤max{aj-j│bk≤j

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int l=1e9+7;
int a[3000020];
int b[250010];
int c[250010];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        long long int num=0,sum=0;
        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+1+n);
        for(int i=n; i>=1; i--)
        {
            if(a[i]-i>=num)
                num=a[i]-i;
            c[i]=num;
        }
        int maxx=-99999999;
        for(int i=1; i<=n; i++)
        {
            if(c[b[i]]>maxx)
                a[n+i]=c[b[i]];
            else
                a[n+i]=maxx;
            if(a[n+i]-n-i>maxx)
                maxx=a[n+i]-n-i;
            sum+=a[n+i];
            if(sum>=l)
                sum%=l;
        }
        printf("%lld\n",sum);
    }
    return 0;
}