제출 #949159

#제출 시각아이디문제언어결과실행 시간메모리
949159Muhammad_AneeqHacker (BOI15_hac)C++17
0 / 100
0 ms348 KiB
/* بسم الله الرحمن الرحيم Author: (:Muhammad Aneeq:) */ #include <iostream> using namespace std; inline void solve() { int n; cin>>n; int a[n]; for (auto& i:a) cin>>i; int pre[n+1]={}; for (int i=0;i<n;i++) pre[i+1]=pre[i]+a[i]; int ans=0; for (int i=1;i<=n;i++) ans=max(ans,a[i-1]+min(pre[i-1],pre[n]-pre[i])); cout<<ans<<endl; } int main() { ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...