| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 680279 | stevancv | Discharging (NOI20_discharging) | C++14 | 1076 ms | 18116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define sadd(a, b) a = Add(a, b)
#define smul(a, b) a = Mul(a, b)
using namespace std;
const int N = 1e6 + 2;
const int mod = 1e9 + 7;
ll a[N], dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int mx = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
smax(a[i], a[i - 1]);
}
ll ans = 1e18;
for (int i = n; i >= 1; i--) {
ll o = 1e18;
for (int j = i + 1; j <= n; j++) if (a[i] < a[j]) smin(o, dp[j] - a[j] * i);
dp[i] = a[i] * n;
if (o != 1e18) dp[i] += o;
smin(ans, dp[i]);
}
cout << ans << en;
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
