Submission #1171815

#TimeUsernameProblemLanguageResultExecution timeMemory
1171815julia_08Hacker (BOI15_hac)C++20
40 / 100
1092 ms2800 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int MAXN = 5e5 + 10; int v[MAXN]; int32_t main(){ cin.tie(0)->sync_with_stdio(0); int n; cin >> n; int tot_sum = 0; for(int i=1; i<=n; i++){ cin >> v[i]; tot_sum += v[i]; } int ans = -1e9; for(int i=1; i<=n; i++){ // brutando primeira pos vector<int> a; for(int j=i+1; j<=n; j++) a.push_back(v[j]); for(int j=1; j<i; j++) a.push_back(v[j]); int max_sum = 0, cur_sum = 0; for(int i=0; i<n/2; i++) cur_sum += a[i]; max_sum = cur_sum; for(int i=1; i<=(n + 1) / 2; i++){ cur_sum -= a[i - 1]; cur_sum += a[i + n / 2 - 1]; max_sum = max(max_sum, cur_sum); } ans = max(ans, tot_sum - max_sum); } cout << ans << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...