1003.Maximum Sequence
来源:互联网 发布:淘宝正品代购店 编辑:程序博客网 时间:2024/06/10 09:23
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 onan+1…a2n : for each number ai, you must choose a numberbk from {bi }, and it must satisfyai ≤max{aj−j|bk≤j<i }, and anybk 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≤ai ≤1500000, 1≤bi ≤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 }, thena2…a4 are available fora5 , and you can leta5 =a2 -2=9;
2. Choose 1 from {bi }, thena1…a5 are available fora6 , and you can leta6 =a2 -2=9;
找规律的题目
//AC: 624MS 5220k#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<cmath>#include<algorithm>#include<vector>#include<queue>const int mod=1e9+7;using namespace std;typedef long long LL;int a[3000020];int c[230005];int b[250005];int main(){ int n; int t=0; while(scanf("%d",&n)!=EOF){ LL ans=0,sum=0; t++; if(t>20) break; 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+n+1); for(int i=n;i>0;i--){ if(a[i]-i>=ans) ans=a[i]-i; c[i]=ans; } int max=-1; for(int i=1;i<=n;i++){ if(c[b[i]]>max) a[n+i]=c[b[i]]; else a[n+i]=max; if(a[n+i]-n-i>max) max=a[n+i]-n-i; sum+=a[n+i]; if(sum>mod) sum%=mod; } printf("%lld\n",sum); } return 0;}
- 1003.Maximum Sequence
- Maximum Sequence
- Maximum Sequence
- Maximum Sequence
- Maximum Sequence
- [HDU]-6047 Maximum Sequence
- 多校6047Maximum Sequence
- HDOJ 6047-Maximum Sequence
- hdu 6047 Maximum Sequence
- [HDU 6047]Maximum Sequence
- HDU 6047 Maximum Sequence
- HDU6047 Maximum Sequence【STL】
- hdu 6047 Maximum Sequence
- HDU 6047 Maximum Sequence
- hdu 6047 Maximum Sequence
- HDU6047-Maximum Sequence
- HDU 6047 Maximum Sequence
- hdu--6047--Maximum Sequence
- 使用双线性插值法放大图像(matlab实现)
- notes of 30 days to learn html &css
- Volecity模板引擎学习笔记<一> 标签: 模板引擎volecity 2016-03-20 17:29 1229人阅读 评论(0) 收藏 举报 分类: Java开发(36) web前端(13
- 路由优先级
- 反转链表
- 1003.Maximum Sequence
- RedHat下安装HAProxy
- LeetCode 167 Two Sum II
- 深入理解Java:注解(Annotation)基本概念
- 1166 Sorting LightOJ【置换群基础】
- Java Callable的用法
- hdu6055--Regular polygon
- angularjs之ui Bootstrap翻页效果
- POJ