Buy Low, Sell High

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;



int main() {

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

  int n;
  cin >> n;
  vector<int> inputti(n+5);
  vector<int> leftmin(n+5);
  vector<int> rightmax(n+5);
  vector<int> leftbest(n+5);
  vector<int> 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]);


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

    cout<<outcome<<endl;

}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED