| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1364584 | jump | Hacker (BOI15_hac) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
#define int long long
int n;
int arr[500500];
int pref[500500];
signed main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n;
for(int i=1;i<=n;i++){
std::cin >> arr[i];
pref[i]=pref[i-1]+arr[i];
}
int max=0;
for(int i=1;i<=n;i++){
int min=1e18;
for(int j=1;j<=n/2;j++){
min=std::min(min,pref[j+((n+1)/2)]-pref[j]);
}
max=std::max(max,min);
}
std::cout << max;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
