# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954722 | PieArmy | Hacker (BOI15_hac) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
typedef long long ll;
ll pie(ll army){return (1ll<<army);}
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define mid ((left+right)>>1)
const ll inf=2000000000000000005;
const int sonsuz=2000000005;
using namespace std;
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}
void code(){
int n;cin>>n;
int arr[n<<1];
for(int i=0;i<n;i++){
cin>>arr[i];
arr[i+n]=arr[i];
}
int sms[n<<1];
int sum=0;
for(int i=0;i<((n+1)>>1)-1;i++)
sum+=arr[i];
for(int i=0;i<n;i++){
sum+=arr[i+((n+1)>>1)-1];
sms[i]=sum;
sum-=arr[i];
}
int ans=0;
multiset<int>st;
for(int i=0;i<((n+1)>>1)-1;i++)
st.insert(sms[i]);
for(int i=0;i<n;i++){
st.insert(sms[i+((n+1)>>1)-1]);
ans=max(ans,*st.begin());
st.erase(st.find(sms[i]));
}
cout<<ans;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
int t=1;
if(!t)cin>>t;
while(t--){code();cout<<endl;}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |