Three displays C++题解

Three displays C++题解

Time limit：1000 ms Memory limit：262144 kB Source: Codeforces Round #485 (Div. 2) Tags: brute force dp implementation *1400

描述

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 si 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 si<sj<sk should be held.

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

输入

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

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

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

输出

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 si<sj<sk.

Input

5
2 4 5 4 10
40 30 20 10 40

Output

90

Input

3
100 101 100
2 4 5

Output

-1

Input

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

Output

33

提示

In the first example you can, for example, choose displays 1, 4 and 5, because s1<s4<s5 (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.

代码

#include <bits/stdc++.h>

#define PI 3.14159265358979383246
#define LL long long

#define _for(i, a) for(int i = 0; i < (a); ++i)
#define _rep(i, a, b) for(int i = (a); i < (b); ++i)
#define _forit(a, b) for(a::iterator it = b.begin(); it != b.end(); it++)


using namespace std;

const int maxn = 3007, inf = 0x3f3f3f3f;
int f[maxn][4], n, val[maxn], cost[maxn], ans = inf;
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", val + i);
	for (int i = 1; i <= n; i++) scanf("%d", cost + i);
	memset(f, 0x3f, sizeof(f));
	for (int i = 1; i <= n; i++) {
		f[i][1] = cost[i];
		for (int k = 2; k <= 3; k++)
			for (int j = 1; j < i; j++)
				if (val[j] < val[i]) f[i][k] = std::min(f[i][k], f[j][k - 1] + cost[i]);
	}
	for (int i = 1; i <= n; i++) ans = std::min(ans, f[i][3]);
	printf("%d\n", ans == inf ? -1 : ans);
	return 0;
}

本人也是新手，也是在学习中，勿喷

转载请注明出处

欢迎有问题的小伙伴一起交流哦~