多校联合赛第二场Mammum Sequence(贪心)
来源:互联网 发布:儒道数据分析地址 编辑:程序博客网 时间:2024/06/16 06:21
Maximum Sequence
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1309 Accepted Submission(s): 619
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
Sample Output
27HintFor 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;
解题关键是qwq数组
#includeusing namespace std; #define maxn 250010 int mod = 1e9+7;int a[maxn*2],b[maxn],qwq[maxn];//qwq最重要的储存数组int work(int n){ int x; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); memset(qwq,0,sizeof(qwq)); priority_queue ans;//优先队列排序 for(int i = 1;i <= n; ++i) { scanf("%d",&x); a[i] = x-i; } for(int i = n;i >= 1;--i) { qwq[i] = max(a[i],qwq[i+1]);//让qwq[i]表示从i到n的a[i]数组中的最大值,并储存在qwq数组中 } for(int i = 1;i <= n; ++i) { scanf("%d",&b[i]); } for(int i = 1;i <=n ;++i) { ans.push(qwq[b[i]]);//进队 } int abs = 0,tmp = 0; for(int i = n+1;i <= 2*n ;++i) { int s =ans.top(); if(tmp>s) { a[i] = tmp - i; } else { a[i] = s-i; ans.pop(); } abs = (abs+a[i]+i)%mod; tmp = max(tmp,a[i]); } return abs;}int main(){ int n; while(~scanf("%d",&n)) { int m = work(n); printf("%d\n",m); } return 0;}
阅读全文
0 0
- 多校联合赛第二场Mammum Sequence(贪心)
- 2017多校联合第二场 1003题 hdu 6047 Maximum Sequence O(n) (有理有据地)贪心
- 2017年多校赛第二场 1003.Maximum Sequence(贪心)
- 多校联合 第二场 A
- 多校联合 第二场 E DP
- 2016多校联合第二场
- 2017多校训练第二场 hdu6047 Maximum Sequence(贪心)
- 2017 多校训练第二场 HDU 6047 Maximum Sequence(贪心+优先队列)
- hdu5288 OO’s Sequence 二分 多校联合第一场
- 2015多校联合第一场hdu5288OO’s Sequence
- hdu5289||2015多校联合第一场1002贪心+RMQ
- [枚举+贪心] hdu5353多校联合 第六场 Average
- [贪心+优先队列] hdu5360多校联合 第六场 Hiking
- [贪心]hdu5355 多校联合第六场 Cake
- hdu5353||2015多校联合第六场1001 贪心
- hdu5360||多校联合第6场1008 贪心
- [贪心] hdu5386 多校联合第八场 Cover
- 2017多校联合第十场/HDU 6180 Schedule (贪心)
- 阿里云域名+老薛主机 搭建个人博客网站 小结
- 根据条件控制Grid列能否编辑
- RESTful笔记
- 正则表达式入门
- Leetcode: Binary Tree Zigzag Level Order Traversal
- 多校联合赛第二场Mammum Sequence(贪心)
- Codeforces Round #425 (Div. 2)比赛总结
- svn
- JavaSE异常类
- 函数的调用过程
- HTML5中的Workers多线程处理
- 对象转型
- 访问同一域名,手机端跳转不同链接
- Linux 字符截取命令