Skip to content

Codeforces 987C #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
PapelRasgado wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Codeforces 987C #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
61 changes: 61 additions & 0 deletions codeforces/987C.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,61 @@
#include <bits/stdc++.h>

using namespace std;

const long long int inf = 10000000000;

const int MAX = 3002;

long long int lista[MAX];
long long int custo[MAX];
long long int dp[MAX][4];

long long int c, a, ans;

int n;

long long int bruto(int i, int ant, int rest){
if(rest == 0)
return 0;
if(i == n+1)
return inf;

if(lista[i] > lista[ant]){
if(dp[i][rest] == inf)
dp[i][rest] = bruto(i + 1, i, rest - 1) + custo[i];

c = bruto(i + 1, ant, rest);

return min(dp[i][rest], c);
} else
return bruto( i + 1, ant, rest);
}

void prep(){
for(int i = 0; i < n+2; i++)
for(int j = 0; j < 4; j++)
dp[i][j] = inf;
}

int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for(int i = 1; i < n+1; i++){
cin >> a;
lista[i] = a;
}
for(int i = 1; i < n+1; i++){
cin >> a;
custo[i] = a;
}
prep();

ans = bruto(1, 0, 3);

if(ans < inf)
cout << ans;
else
cout << -1;

cout << endl;
}