結果
問題 | No.919 You Are A Project Manager |
ユーザー | firiexp |
提出日時 | 2019-10-26 00:09:45 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,682 bytes |
コンパイル時間 | 912 ms |
コンパイル使用メモリ | 90,172 KB |
最終ジャッジ日時 | 2024-11-14 21:47:40 |
合計ジャッジ時間 | 1,996 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:17:39: error: '::numeric_limits' has not been declared 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^~~~~~~~~~~~~~ main.cpp:17:55: error: expected primary-expression before '>' token 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^ main.cpp:17:61: error: no matching function for call to 'max()' 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)' 254 | max(const _Tp& __a, const _Tp& __b) | ^~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed: main.cpp:17:61: note: candidate expects 2 arguments, 0 provided 17 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 1000000007; using ll = long long; using u32 = uint32_t; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; template <class T> ostream& operator<<(ostream& os, vector<T> v) { os << "{"; for (int i = 0; i < v.size(); ++i) { if(i) os << ", "; os << v[i]; } return os << "}"; } template <class L, class R> ostream& operator<<(ostream& os, pair<L, R> p) { return os << "{" << p.first << ", " << p.second << "}"; } int main() { int n; cin >> n; vector<int> v(n); for (auto &&i : v) scanf("%d", &i); vector<ll> a, b; auto u = v; ll ans = 0; for (int K = n; K >= 1; --K) { a.resize(n/K); b.resize(n/K+1); for (int i = 0; i < n/K; ++i) { nth_element(u.begin()+i*K, u.begin()+i*K+(K-1)/2, u.begin()+(i+1)*K); a[i] = u[i*K+(K-1)/2]; } u = v; for (int i = 0; i < n/K; ++i) { nth_element(u.rbegin()+i*K, u.rbegin()+i*K+(K-1)/2, u.rbegin()+(i+1)*K); b[i+1] = b[i]+u[n-(i*K+(K-1)/2)-1]; } u = v; for (int i = 0; i < n/K; ++i) { b[i+1] = max(b[i+1], b[i]); } ll p = 0; int cur = 0; ll s = 0; for (int i = 0; i < n/K; ++i) { while(i*K-1 >= n-K*(n/K+1-cur)) cur++; p = max(p, s+b[n/K+1-cur]); s += a[i]; } ans = max({ans, p*K, s*K}); } cout << ans << "\n"; return 0; }