codeforces-C. Three displays（有先提条件三个值相加求最大值）（暴力--简单粗暴好理解）

最新推荐文章于 2020-07-15 16:52:58 发布

axiaobingqiu

最新推荐文章于 2020-07-15 16:52:58 发布

阅读量200

点赞数

分类专栏： cf题

本文链接：https://blog.csdn.net/ab1605014317/article/details/82259569

版权

cf题专栏收录该内容

15 篇文章 0 订阅

订阅专栏

题面：

C. Three displays

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

It is the middle of 2018 and Maria Stepanovna, who lives outside Krasnokamensk (a town in Zabaikalsky region), wants to rent three displays to highlight an important problem.

There are nn displays placed along a road, and the ii-th of them can display a text with font size sisi only. Maria Stepanovna wants to rent such three displays with indices i<j<ki<j<k that the font size increases if you move along the road in a particular direction. Namely, the condition si<sj<sksi<sj<sk should be held.

The rent cost is for the ii-th display is cici. Please determine the smallest cost Maria Stepanovna should pay.

Input

The first line contains a single integer nn (3≤n≤30003≤n≤3000) — the number of displays.

The second line contains nn integers s1,s2,…,sns1,s2,…,sn (1≤si≤1091≤si≤109) — the font sizes on the displays in the order they stand along the road.

The third line contains nn integers c1,c2,…,cnc1,c2,…,cn (1≤ci≤1081≤ci≤108) — the rent costs for each display.

Output

If there are no three displays that satisfy the criteria, print -1. Otherwise print a single integer — the minimum total rent cost of three displays with indices i<j<ki<j<k such that si<sj<sksi<sj<sk.

Examples

input

Copy

5
2 4 5 4 10
40 30 20 10 40

output

Copy

input

Copy

3
100 101 100
2 4 5

output

Copy

-1

input

Copy

10
1 2 3 4 5 6 7 8 9 10
10 13 11 14 15 12 13 13 18 13

output

Copy

Note

In the first example you can, for example, choose displays 11, 44 and 55, because s1<s4<s5s1<s4<s5 (2<4<102<4<10), and the rent cost is 40+10+40=9040+10+40=90.

In the second example you can't select a valid triple of indices, so the answer is -1.

这道题有一个关键就是只有三个数，取最小值。这就可以依据题面暴力。但是有一点就是最好选择中间的是暴力这样一个找比他小的，一个找比他大的。通过min不断取值最后输出。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#define pi acos(-1)
using namespace std;
typedef long long ll;
const int maxn=3000+10;
const int INF=0x3f3f3f3f;
const double EPS = 1e-10;
inline int read(){
    int ret=0,f=0;char ch=getchar();
    while(ch>'9'||ch<'0') f^=ch=='-',ch=getchar();
    while(ch<='9'&&ch>='0') ret=ret*10+ch-'0',ch=getchar();
    return f?-ret:ret;
}
ll n;
ll s[maxn],c[maxn];
int main(){
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=0;i<n;i++)cin>>s[i];
	for(int i=0;i<n;i++)cin>>c[i];
	
	ll ans=1e10;
	for(int i=0;i<n;i++){
		ll minn1=1e10;
		ll minn2=1e10;
		for(int j=0;j<i;j++){
			if(s[j]<s[i]) minn1=min(minn1,c[j]);
		}
		for(int j=i;j<n;j++){
			if(s[j]>s[i]) minn2=min(minn2,c[j]);
		}
		ans=min(ans,minn1+minn2+c[i]);
	}
	if(ans!=1e10)cout<<ans<<endl;
	else cout<<-1<<endl; 
	return 0;
}

这道题很好。