CSES - HIIT Open 2018 - Results
 Task: Buy Low, Sell High Sender: Lucinda Submission time: 2018-05-26 12:32:32 Language: C++ Status: READY Result: TIME LIMIT EXCEEDED
Test results
testverdicttime
#1--details
#2--details
#3--details
#4--details
#5--details
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.02 sdetails
#8ACCEPTED0.01 sdetails
#9--details

### Code

```#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <vector>

using namespace std;

int main() {
int n;
cin >> n;
int *a = new int[n];

for (int i = 0; i < n; i++)
cin >> a[i];

int *b_pref = new int[n];
int *b_suf = new int[n];
b_pref[0] = 0; // first day buy and sell
b_suf[n - 1] = 0; // last day buy and sell

for (int i = 1; i < n; i++) { // points at end of period
int end = a[i];
int best_so_far = b_pref[i - 1];
// go back and check is there a small value
// such that is gives better res than b_pref
for (int j = i - 1; j >= 0; j--) {
if (end - a[j] > best_so_far) {
best_so_far = end - a[j];
}
}
b_pref[i] = best_so_far;
}

/* cout << endl;
for (int i = 0; i < n; i++)
cout << b_pref[i] << " ";
*/
for (int i = n - 2; i >= 0; i--) { // points at the start of period
int start = a[i];
int best_so_far = b_suf[i + 1];
for (int j = i + 1; j < n; j++) {
if (a[j] - start > best_so_far) {
best_so_far = a[j] - start;
}
}
b_suf[i] = best_so_far;
}

/* cout << endl;
for (int i = 0; i < n; i++)
cout << b_suf[i] << " ";
*/
int best = 0;
for (int i = 0; i < n; i++) {
if (b_pref[i] + b_suf[i] > best)
best = b_pref[i] + b_suf[i];
}
cout << best << endl;

delete[] a;
delete[] b_pref;
delete[] b_suf;
}
```

### Test details

#### Test 1

Verdict:

input
500000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
0

user output
(empty)

#### Test 2

Verdict:

input
500000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
499999

user output
(empty)

#### Test 3

Verdict:

input
500000
500000 499999 499998 499997 49...

correct output
0

user output
(empty)

#### Test 4

Verdict:

input
500000
617752857 533265574 365848360 ...

correct output
1999980408

user output
(empty)

#### Test 5

Verdict:

input
500000
209620375 316066031 756114325 ...

correct output
1999992655

user output
(empty)

#### Test 6

Verdict: ACCEPTED

input
1
1

correct output
0

user output
0

#### Test 7

Verdict: ACCEPTED

input
2
1 1

correct output
0

user output
0

#### Test 8

Verdict: ACCEPTED

input
2
2 1

correct output
0

user output
0

#### Test 9

Verdict:

input
500000
1 1000000000 2 2 2 2 2 2 2 2 2...

correct output
1999999998

user output
(empty)