Code Submission Evaluation System Login

HIIT Open 2018

Start:2018-05-26 11:00:00
End:2018-05-26 16:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - HIIT Open 2018 - Results
History
2018-05-26 11:49:38
2018-05-26 11:31:56
2018-05-26 11:30:04
Task:Buy Low, Sell High
Sender:HIIT AND RUN
Submission time:2018-05-26 11:49:38
Language:C++
Status:READY
Result:ACCEPTED

Test results

testverdicttime (s)
#1ACCEPTED0.13 / 1.00details
#2ACCEPTED0.18 / 1.00details
#3ACCEPTED0.17 / 1.00details
#4ACCEPTED0.25 / 1.00details
#5ACCEPTED0.25 / 1.00details
#6ACCEPTED0.01 / 1.00details
#7ACCEPTED0.01 / 1.00details
#8ACCEPTED0.01 / 1.00details
#9ACCEPTED0.12 / 1.00details

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<ll> v;

int main() {
    int n;
    cin >> n;
    
    v.resize(n);
    for (int i = 0; i < n; i++) {
        ll x;
        cin >> x;
        v[i] = x;
    }
    
    ll minStart = v[0];
    ll maxProfitAnywhereBetween = 0;
    vector<ll> l(n);
    
    for (int i = 0; i < n; i++) {
        minStart = min(minStart, v[i]);
        ll profitIfSellHere = v[i] - minStart;
        maxProfitAnywhereBetween = max(maxProfitAnywhereBetween, profitIfSellHere);
        l[i] = maxProfitAnywhereBetween;
    }
    
    ll maxEnd = v[n-1];
    maxProfitAnywhereBetween = 0;
    vector<ll> r(n);
    
    for (int i=n-1; i >= 0; i--) {
        maxEnd = max(maxEnd, v[i]);
        ll profitIfBuyHere = maxEnd - v[i];
        maxProfitAnywhereBetween = max(maxProfitAnywhereBetween, profitIfBuyHere);
        r[i] = maxProfitAnywhereBetween;
    }
    ll ans = 0;
    for (int i =0; i < n; i++) {
        ans = max(ans, l[i] + r[i]);
    }
    
    cout << ans << endl;
    
    
    
}

Test details

Test 1

Verdict: ACCEPTED

input
500000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

correct output
0
view   save

user output
0
view   save

Test 2

Verdict: ACCEPTED

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

correct output
499999
view   save

user output
499999
view   save

Test 3

Verdict: ACCEPTED

input
500000
500000 499999 499998 499997 49...
view   save

correct output
0
view   save

user output
0
view   save

Test 4

Verdict: ACCEPTED

input
500000
617752857 533265574 365848360 ...
view   save

correct output
1999980408
view   save

user output
1999980408
view   save

Test 5

Verdict: ACCEPTED

input
500000
209620375 316066031 756114325 ...
view   save

correct output
1999992655
view   save

user output
1999992655
view   save

Test 6

Verdict: ACCEPTED

input
1
1
view   save

correct output
0
view   save

user output
0
view   save

Test 7

Verdict: ACCEPTED

input
2
1 1
view   save

correct output
0
view   save

user output
0
view   save

Test 8

Verdict: ACCEPTED

input
2
2 1
view   save

correct output
0
view   save

user output
0
view   save

Test 9

Verdict: ACCEPTED

input
500000
1 1000000000 2 2 2 2 2 2 2 2 2...
view   save

correct output
1999999998
view   save

user output
1999999998
view   save