Codeforces 987C 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 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 (3n30003≤n≤3000) — the number of displays.

The second line contains nn integers s1,s2,,sns1,s2,…,sn (1si1091≤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 (1ci1081≤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
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 1144 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.

题意:给你一个大小序列,一个价值序列,让你选出3个数来要求 i  < j < k, si < sj < sk,求满足要求的序列中总价值最小是多少

思路:算是好题, 既然只选3个数, 我的思路是先 n^2选出两个数的最小价值,再跑一边选出3个数的最小价值。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 3e3 + 5;
const int inf = 1e9 + 7;
int pre[maxn], s[maxn], c[maxn];
int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        for(int i = 0; i < maxn; i++)
            pre[i] = inf;
        int ans = inf;
        for(int i = 1; i <= n; i++)
            scanf("%d", &s[i]);
        for(int i = 1; i <= n; i++)
            scanf("%d", &c[i]);
        for(int i = 2; i <= n; i++)
        {
            for(int j = 1; j < i; j++)
            {
                if(s[j] < s[i]) pre[i] = min(pre[i], c[i] + c[j]);
            }
            for(int j = 2; j < i; j++)
            {
                if(s[j] < s[i]) ans = min(ans, c[i] + pre[j]);
            }
        }
        if(ans == inf) ans = -1;
        printf("%d\n", ans);
    }
    return 0;
}


阅读更多
版权声明:希望我的博客可以为别人带去知识与便利,让那些像我曾经一样迷茫的小伙伴不再迷茫~ https://blog.csdn.net/qq_34374664/article/details/80962194
个人分类: CF
上一篇Codeforces 991D Bishwock (模拟)
下一篇Sift中尺度空间、高斯金字塔、差分金字塔(DOG金字塔)、图像金字塔
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭