hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
2017-07-27 17:24
411 查看
Maximum Sequence
Problem DescriptionSteph 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;
官方题解:
代码:
#include<stdio.h> #include<string.h> #include<queue> #include<algorithm> using namespace std; const int maxn=250000+10; const int mod=1e9+7; int maxx[maxn],a[maxn<<1],b[maxn]; int n; int main() { while(~scanf("%d",&n)) { memset(maxx,0,sizeof(maxx)); int x; for(int i=1;i<=n;++i) scanf("%d",&x),a[i]=x-i; for(int i=n;i>0;--i)//预处理出i~n的最大值 maxx[i]=max(maxx[i+1],a[i]); for(int i=1;i<=n;++i) scanf("%d",&b[i]); priority_queue<int>qs; for(int i=1;i<=n;++i) qs.push(maxx[b[i]]); int tmp=0,ans=0; for(int i=n+1;i<=n<<1;++i) { if(tmp>qs.top()) a[i]=tmp-i; else a[i]=qs.top()-i,qs.pop(); ans=(ans+a[i]+i)%mod; tmp=max(tmp,a[i]); } printf("%d\n",ans); } return 0; }
<
d1d3
link rel="stylesheet" href="https://csdnimg.cn/release/phoenix/production/markdown_views-ea0013b516.css" />
相关文章推荐
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- 2017 Multi-University Training Contest - Team 2 && HDU6047
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)
- hdu 6055 Regular polygon(判断正方形)(2017 Multi-University Training Contest - Team 2)
- HDU 6165 - FFF at Valentine DFS暴力 2017 Multi-University Training Contest - Team 9
- 【2017 Multi-University Training Contest - Team 7 && hdu 6121】Build a tree
- hdu 6058 Kanade's sum(链表)(2017 Multi-University Training Contest - Team 3 )
- hdu 6069 Counting Divisors(约数个数)(2017 Multi-University Training Contest - Team 4 )