2017多校训练Contest2: 1003 Maximum Sequence hdu6047
来源:互联网 发布:怎么查看数据库ip 编辑:程序博客网 时间:2024/05/29 04:56
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<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.
Given two integer sequences {ai} and {bi} with the same length n, you are to find the next n numbers of {ai}:
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.
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
48 11 8 53 1 4 2
按照题意把bi-i压入堆中,每次取最大的即可
#include<queue>#include<vector>#include<cstdio>#include<string>#include<cstring>#include<cassert>#include<iostream>#include<algorithm>using namespace std;long long mod=1000000007;long long a[250001];int b[250001];priority_queue<pair<long long,int>> Q;int main(){ int n; while(scanf("%d",&n)!=EOF) { int i; while(!Q.empty()) Q.pop(); for(i=1;i<=n;i++) { scanf("%lld",&a[i]); Q.push(make_pair(a[i]-i,i)); } for(i=1;i<=n;i++) scanf("%d",&b[i]); sort(b+1,b+1+n); long long ans=0; for(i=1;i<=n;i++) { pair<long long,int> d; d=Q.top(); // Q.pop(); while(d.second<b[i]) { Q.pop(); d=Q.top(); } ans+=d.first; ans%=mod; d.first-=(i+n); d.second=i+n; Q.push(d); } ans=(ans+mod)%mod; printf("%lld\n",ans); } return 0;}
阅读全文
0 0
- 2017多校训练Contest2: 1003 Maximum Sequence hdu6047
- 2017多校训练第二场 hdu6047 Maximum Sequence(贪心)
- HDU-2017 多校训练赛2-1003-Maximum Sequence
- 2017多校训练Contest2: 1001 Captain is coding hdu6045
- 2017多校训练Contest2: 1009 TrickGCD hdu6053
- 2017多校训练Contest2: 1011 Regular polygon hdu6055
- 2017多校训练Contest2: 1006 Funny Function hdu6050
- 2017 多校训练第二场 HDU 6047 Maximum Sequence
- 2017多校联合二1003(hdu6047)Maximum Sequence
- hdu6047 Maximum Sequence 2017多校二1003
- HDU 6047 (2017 多校训练赛2 1003)Maximum Sequence
- HDU6047---Maximum Sequence(2017多校联赛C题)
- 2017 多校训练第二场 HDU 6047 Maximum Sequence(贪心+优先队列)
- HDU6047 Maximum Sequence(贪心,暑期训练1003)
- 【2017多校】HDU6047 Maximum Sequence 【贪心】
- HDU6047 Maximum Sequence【STL】
- HDU6047-Maximum Sequence
- hdu6047--Maximum Sequence
- 在Ubuntu16.04中安装MySQL
- JDBC学习
- 重写(Overriding)与重载(Overloading)的区别
- java事务全解析(六)--使用动态代理(Dynamic Proxy)完成事务
- 快速幂或找规律求a的b次方的最后一位-HDU1097
- 2017多校训练Contest2: 1003 Maximum Sequence hdu6047
- 【折半枚举】HDU_5616_Jam's balance
- 正则表达式
- golang 数组去重
- Andrew Ng机器学习课程笔记(五)之应用机器学习的建议
- [JavaScript]页面判断上传文件大小
- 概率基础4-数字特征与特征函数
- Linux功耗管理(11)_Runtime PM之功能描述
- Python print格式化输出