# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31576 | 2017-08-30T01:50:04 Z | huynd2001 | Hacker (BOI15_hac) | C++14 | 0 ms | 9828 KB |
/*huypheu 5 1 1 1 1 1 */ #include <bits/stdc++.h> #define int long long using namespace std; int a[500007]; int su[500007]; signed main() { int n; scanf("%lld",&n); for(int i=1;i<=n;i++) { scanf("%lld",&a[i]); } int la=(n/2)+1; for(int i=1;i<=n;i++) { su[i]=su[i-1]+a[i]; } int mi=su[n]; for(int i=2;i<=n-la+1;i++) { mi=min(mi,su[i+la-1]-su[i-1]); } printf("%lld\n",mi); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 9828 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 9828 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 9828 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 9828 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |