Codeforces 987 C. Three displays [思维 +递推dp]

C. Three displays

time limit per tes :

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.

题目：要求i < j < k， s[ i ] < s[ j ] < s[ k ];c[ i ] + c[ j ] + c[ k ]的最小值;

先求两个的和，再反向推出三个的和。。。算是用了两遍 dp 吧。。。

代码：

 

#include<bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 3e3+7;
int n;
ll s[maxn], c[maxn], val[maxn];
bool vis[maxn];

int main()
{
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d", &n))
    {
        memset(vis, 0, sizeof(vis));
        for(int i = 0; i < n; i++) scanf("%lld", &s[i]);
        for(int i = 0; i < n; i++) scanf("%lld", &c[i]);
        for(int j = 0; j < n; j++)
        {
            ll m = INF;
            val[j] = c[j];
            for(int k = j - 1; k >= 0; k--)
            {
                if(s[j] > s[k]) {
                    m = min(m, c[k]);
                }
            }
            if(m != INF)
            {
                vis[j] = true;
                val[j] += m;
            }
        }
        ll ans = 999999999999999;
        for(int j = 0; j < n; j++)
        {
            if(!vis[j]) continue;
            for(int k = j + 1; k < n; k++)
            {
                if(s[j] < s[k]) {
                    ans = min(ans, val[j] + c[k]);
                }
            }
        }
        if(ans == 999999999999999) printf("-1\n");
        else printf("%lld\n", ans);
    }
    return 0;
}