제출 #796183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
796183		jmyszka2007	Hacker (BOI15_hac)	C++17	0 / 100	1 ms	296 KiB

hac

#include <bits/stdc++.h>
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#define check(x) if (!(x)) { cerr << "Check failed: " << #x << " in line " << __LINE__ << endl; exit(1); }
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#define check(x) 
#endif
typedef long long ll;
#define pi pair<int, int>
#define pl pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
void solve() {
	int n;
	cin >> n;
	vi tab(3 * n);
	vi sum(3 * n, 0);
	for(int i = 0; i < n; i++) {
		cin >> tab[i];
		tab[i + n] = tab[i];
		tab[i + 2 * n] = tab[i];
	}
	sum[0] = tab[0];
	for(int i = 1; i < 3 * n; i++) {
		sum[i] = tab[i] + sum[i - 1];
	}
	auto get_sum = [&](int l, int r) {
		if(r < l) {
			return 0;
		}
		if(!l) {
			return sum[r];
		}
		return sum[r] - sum[l - 1];
	};
	int ans = 0;
	for(int i = n; i < 2 * n; i++) {
		ans = max(ans, tab[i] + min(get_sum(i - (n - 1) / 2, i - 1), get_sum(i + 1, i + (n - 1) / 2)));
	}
	cout << ans << '\n';
}
int main() {
	fastio();
	int t;
	//cin >> t;
	t = 1;	
	while(t--) {
		solve();
	}
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 40