2017 Multi-University Training Contest
来源:互联网 发布:c语言编译器安卓 编辑:程序博客网 时间:2024/06/14 06:02
题目:
Maximum Sequence
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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;
题意:给你长度为n的两个数组a和b。求
思路:不知道怎么讲,就是求
a_i-i 7 9 5 1 4 3 -2 -4
b_i 3 1 4 2
#include<bits/stdc++.h>using namespace std;#define maxn 250005__int64 a[maxn],b[maxn],c[maxn];int main(){ int n,i; __int64 maxr,sum,mod=1e9+7; while(~scanf("%d",&n)){ for(i=1;i<=n;i++){ scanf("%I64d",&a[i]); a[i]-=i; if(i>1) maxr=max(maxr,a[i]); else maxr=a[i]; } maxr-=(n+1); for(i=n;i>=1;i--){ c[i]=max(maxr,a[i]); if(i<n) c[i]=max(c[i],c[i+1]); } sum=0; for(i=1;i<=n;i++){ scanf("%I64d",&b[i]); sum=(sum+c[b[i]])%mod; } printf("%I64d\n",sum); } return 0;}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- SSM框架添加RESTAPI应用
- Apache Zeppelin简介与源码
- 【Oracle 12c Flex Cluster专题】节点角色转换
- freemarker ftl文件在eclipse高亮显示
- Unity_状态模式_028
- 2017 Multi-University Training Contest
- IDEA activiti插件actiBPM乱码问题
- 2017 Multi-University Training Contest
- springboot顶层工程,打包配置
- java读取excel文件中的数据
- 三论SOC的起源
- 面向对象的设计原则:开放-封闭原则
- 多校6055 Regular polygon
- 栈帧