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 13:33:58
2018-05-26 13:31:18
Task:Buy Low, Sell High
Sender:Puhi~
Submission time:2018-05-26 13:33:58
Language:C++
Status:READY
Result:WRONG ANSWER

Test results

testverdicttime (s)
#1ACCEPTED0.10 / 1.00details
#2ACCEPTED0.19 / 1.00details
#3ACCEPTED0.18 / 1.00details
#4WRONG ANSWER0.24 / 1.00details
#5ACCEPTED0.24 / 1.00details
#6ACCEPTED0.01 / 1.00details
#7ACCEPTED0.01 / 1.00details
#8ACCEPTED0.01 / 1.00details
#9ACCEPTED0.09 / 1.00details

Code

#include <iostream>
#include <stdint.h>

using namespace std;

int64_t prices[500000];

int main() {
    int n;
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> prices[i];
    }
    
    int start = 0;
    int64_t best = 0;
    int best_pos = 0;

    for (int i = 0; i < n; i++) {
        if (prices[i] < prices[start]) {
            start = i;
        }
        
        int64_t p = prices[i] - prices[start];
        if (p > best) {
            best = p;
            best_pos = i;
        }
    }
    
    int bstart = start;
    int bend = best_pos;
    int64_t bbest = best;
    
    //
    start = 0;
    best = 0;
    best_pos = 0;
    
    for (int i = 0; i <= bstart; i++) {
        if (prices[i] < prices[start]) {
            start = i;
        }
        
        int64_t p = prices[i] - prices[start];
        if (p > best) {
            best = p;
            best_pos = i;
        }
    }
    
    int64_t abest = best;
    
    //
    start = bend;
    best = 0;
    best_pos = bend;

    for (int i = bend; i < n; i++) {
        if (prices[i] < prices[start]) {
            start = i;
        }
        
        int64_t p = prices[i] - prices[start];
        if (p > best) {
            best = p;
            best_pos = i;
        }
    }
    
    int64_t ebest = best;
    
    //
    start = bend;
    best = 0;
    best_pos = bend;

    for (int i = bend; i > bstart; i--) {
        if (prices[i] < prices[start]) {
            start = i;
        }
        
        int64_t p = prices[i] - prices[start];
        if (p > best) {
            best = p;
            best_pos = i;
        }
    }
    
    int64_t drop = best;
    
    cout << max(bbest + abest, max(bbest + ebest, bbest + drop)) << 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: WRONG ANSWER

input
500000
617752857 533265574 365848360 ...
view   save

correct output
1999980408
view   save

user output
1999989982
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