CodeForces - 987 C.Three displays(思维暴力)

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 $n$ displays placed along a road, and the $i$-th of them can display a text with font size $s_i$ only. Maria Stepanovna wants to rent such three displays with indices $i<j<k$ that the font size increases if you move along the road in a particular direction. Namely, the condition $s_i<s_j<s_k$ should be held.

The rent cost is for the $i$-th display is $c_i$. Please determine the smallest cost Maria Stepanovna should pay.

Input

The first line contains a single integer $n$ ($3\le n\le 3000$) — the number of displays.

The second line contains $n$ integers $s_1,s_2,\dots ,s_n$ ($1\le s_i\le {10}^9$) — the font sizes on the displays in the order they stand along the road.

The third line contains $n$ integers $c_1,c_2,\dots ,c_n$ ($1\le c_i\le {10}^8$) — 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<k$ such that $s_i<s_j<s_k$.

Examples

Input

Copy

5
2 4 5 4 10
40 30 20 10 40

Output

Copy

90

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

33

Note

In the first example you can, for example, choose displays $1$, $4$ and $5$, because $s_1<s_4<s_5$ ($2<4<10$), and the rent cost is $40+10+40=90$.

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

解题思路：先枚举中间的那个，在分别枚举两边满足条件的最小值即可O(n^2)。

还有个类似的关于区间的问题：CodeForces - 332B. Maximum Absurdity(前缀和+dp)

AC代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<math.h>
#include<stdlib.h>
#include<queue>
#include<map>
#include<set>
#define bug printf("*********\n");
#define mem0(a) memset(a, 0, sizeof(a));
#define mem1(a) memset(a, -1, sizeof(a));
#define in1(a) scanf("%d" ,&a);
#define in2(a, b) scanf("%d%d", &a, &b);
#define out1(a) printf("%d\n", a);
#define out2(a, b) printf("%d %d\n", a, b);
#define pb(G, a, b) G[a].push_back(b);
using namespace std;
typedef long long LL;
typedef pair<int, int> par;
const int mod = 1e9+7;
const int INF = 1e9+7;
const int N = 1000010;
const double pi = 3.1415926;

int s[3010], c[3010];

int main()
{
    int n;
    while(~scanf("%d", &n)) {
        int x, y, z, ans = INF; //INF = 1e9,题目数据最大为3*1e8
        for(int i = 0; i < n; i ++)
            in1(s[i]);
        for(int i = 0; i < n; i ++)
            in1(c[i]);
        for(int i = 0; i < n; i ++) {
            y = c[i];
            x = INF;
            z = INF;
            for(int j = 0; j < i; j ++) { //枚举左边
                if(s[j] < s[i])
                    x = min(x, c[j]);
            }
            for(int j = i+1; j < n; j ++) { //枚举右边
                if(s[j] > s[i])
                    z = min(z, c[j]);
            }
            ans = min(ans, x+y+z);
        }
        if(ans < INF) printf("%d\n", ans);
        else printf("-1\n");
    }
    return 0;
}