题意:有n个物品,每个物品有一个s值,有一个c。我们要挑三s个单调递增的物品,问最小值是多少?如果没有输出-1。
思路:先n^2处理出来每个点后面s比它大的物品中最小的c值。然后暴力枚举两个点,O(1)得到第三个值,求最小值就OK了
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 3005;
const int INF = 1000000005;
typedef long long ll;
int n, s[MAXN], c[MAXN], MIN[MAXN];
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &s[i]);
for (int i = 0; i < n; i++) scanf("%d", &c[i]);
for (int i = 0; i < n; i++)
{
int t = INF;
for (int j = i+1; j < n; j++)
{
if (s[j] > s[i]) t = min(t, c[j]);
}
MIN[i] = t;
}
int ans = INF;
for (int i = 0; i < n; i++)
{
for (int j = i+1; j < n; j++)
{
if (s[j] > s[i]) ans = min(ans, c[i]+c[j]+MIN[j]);
}
}
if (ans != INF) printf("%d\n", ans);
else printf("-1\n");
return 0;
}
/*
5
2 4 5 4 10
40 30 20 10 40
*/