CSES - HIIT Open 2018 - Results
 Task: Buy Low, Sell High Sender: Wave of Technology Submission time: 2018-05-26 11:57:03 +0300 Language: C++ Status: READY Result: ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.07 sdetails
#2ACCEPTED0.12 sdetails
#3ACCEPTED0.10 sdetails
#4ACCEPTED0.13 sdetails
#5ACCEPTED0.11 sdetails
#6ACCEPTED0.02 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.01 sdetails
#9ACCEPTED0.07 sdetails

### Code

```#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {

cin.tie(NULL);
std::ios::sync_with_stdio(false);

ll n;
cin >> n;
vector<ll> inputti(n+5);
vector<ll> leftmin(n+5);
vector<ll> rightmax(n+5);
vector<ll> leftbest(n+5);
vector<ll> rightbest(n+5);

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

// compute leftmin
leftmin[1] = inputti[1];
for(int i = 2; i <= n; i++)
leftmin[i] = min(inputti[i],leftmin[i-1]);

rightmax[n] = inputti[n];
// compute rightmax
for(int i = n-1; i >= 1; i--)
rightmax[i] = max(inputti[i],rightmax[i+1]);

// compute leftbest
leftbest[0] = 0;
for(int i = 1; i <= n; i++)
leftbest[i] = max(inputti[i]-leftmin[i],leftbest[i-1]);

// compute rightbest
rightbest[n+1] = 0;
for(int i = n; i >= 1; i--)
rightbest[i] = max(-inputti[i]+rightmax[i],rightbest[i+1]);

ll outcome = 0;
for(int i = n-1; i >= 1; i--)
outcome = max(outcome,leftbest[i]+rightbest[i]);

outcome = max(outcome, rightbest[1]);
cout<<outcome<<endl;

}
```

### Test details

#### Test 1

Verdict: ACCEPTED

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

correct output
0

user output
0

#### Test 2

Verdict: ACCEPTED

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

correct output
499999

user output
499999

#### Test 3

Verdict: ACCEPTED

input
500000
500000 499999 499998 499997 49...

correct output
0

user output
0

#### Test 4

Verdict: ACCEPTED

input
500000
617752857 533265574 365848360 ...

correct output
1999980408

user output
1999980408

#### Test 5

Verdict: ACCEPTED

input
500000
209620375 316066031 756114325 ...

correct output
1999992655

user output
1999992655

#### 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: ACCEPTED

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

correct output
1999999998

user output
1999999998