oj.uz

Submission #723546

# Submission time Handle Problem Language Result Execution time Memory
723546 2023-04-14T04:54:24 Z yahyobekabdunazarov Hacker (BOI15_hac) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 5e5 + 9;
int a[MAXN], dp[MAXN];
bool used[MAXN];

signed main(){ 
	int n;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> a[i];
		dp[i + 1] = dp[i] + a[i];
	}
	priority_queue<int> pq;
	for(int i = 0; i < n; i++){
		pq.push(dp[min(i + n / 2 + n % 2, n)] - dp[i] + dp[max(i + n / 2 + n % 2 - n, 0ll)]);
	}
	pq.pop();
	cout << pq.top();
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -