CSES - HIIT Open 2018 - Results
Submission details
Task:Buy Low, Sell High
Sender:barely div 2.8 burgeria
Submission time:2018-05-26 11:57:17
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.11 sdetails
#2ACCEPTED0.22 sdetails
#3ACCEPTED0.20 sdetails
#4ACCEPTED0.26 sdetails
#5ACCEPTED0.35 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.01 sdetails
#9ACCEPTED0.11 sdetails

Code

#include <iostream>
#include <vector>
#include <cmath>
#include <string>

using namespace std;

typedef long long LL;

int main(){
	int n; cin>>n;
	vector<LL> nums;
	vector<LL> cumleft(n);
	vector<LL> cumright(n);
	LL tot = 0;
	for (int i = 0; i < n; i++) {
		LL qwe; cin>>qwe;
		tot += qwe;
		cumleft[i] = tot;
		nums.emplace_back(qwe);
	}
	tot = 0;
	for (int i = n-1; i >= 0; i--) {
		tot += nums[i];
		cumright[i] = tot;
	}
	vector<LL> left(n);
	vector<LL> right(n);
	
	LL minv = (LL)1 << 62;
	LL maxv = -1;
	for (int i = 0; i < n; i++) {
		//minv = min(cumleft[i], minv);
		minv = min(nums[i], minv);
		left[i] = nums[i] - minv;
		if (i > 0) left[i] = max(left[i], left[i-1]);
	}

	minv = (LL)1 << 62;
	maxv = -1;
	for (int i = n-1; i >= 0; i--) {
		maxv = max(nums[i], maxv);
		right[i] = maxv - nums[i];
		if (i < n-1) right[i] = max(right[i], right[i+1]);
	}
	LL ans = 0;
	for (int i = 0; i < n; i++) {
//cout << left[i] << "x" << right[i] <<endl;
		ans = max(ans, left[i] + right[i]);
	}
	cout << ans;
}





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