結果
問題 |
No.776 A Simple RMQ Problem
|
ユーザー |
|
提出日時 | 2020-02-08 05:03:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 402 ms / 3,000 ms |
コード長 | 3,878 bytes |
コンパイル時間 | 2,293 ms |
コンパイル使用メモリ | 201,968 KB |
最終ジャッジ日時 | 2025-01-08 22:56:58 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 26 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:118:15: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 2 has type ‘__gnu_cxx::__alloc_traits<std::allocator<long int>, long int>::value_type*’ {aka ‘long int*’} [-Wformat=] 118 | scanf("%lld", &a[i]); | ~~~^ | | | long long int* | %ld main.cpp:158:18: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘int64_t’ {aka ‘long int’} [-Wformat=] 158 | printf("%lld\n", ans); | ~~~^ ~~~ | | | | | int64_t {aka long int} | long long int | %ld main.cpp:111:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 111 | int N,Q; scanf("%d%d", &N, &Q); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:118:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 118 | scanf("%lld", &a[i]); | ~~~~~^~~~~~~~~~~~~~~ main.cpp:126:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 126 | int i, x; scanf("%d%d", &i, &x); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:131:32: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 131 | int l1, l2, r1, r2; scanf("%d%d%d%d", &l1, &l2, &r1, &r2); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h> #ifdef DEBUG #include <Mylib/Debug/debug.cpp> #else #define dump(...) #endif template <typename Monoid> class SegmentTree{ using value_type = typename Monoid::value_type; protected: const int depth, size, hsize; std::vector<value_type> data; public: SegmentTree(int n): depth(n > 1 ? 32-__builtin_clz(n-1) + 1 : 1), size((1 << depth) - 1), hsize(size / 2 + 1), data(size + 1, Monoid::id()) {} inline auto operator[](int i) const {return at(i);} inline auto at(int i) const {return data[hsize + i];} inline auto get(int x, int y) const { // [x,y) std::vector<int> memo; value_type ret_left = Monoid::id(); value_type ret_right = Monoid::id(); int l = x + hsize, r = y + hsize; while(l < r){ if(r & 1) ret_right = Monoid::op(data[--r], ret_right); if(l & 1) ret_left = Monoid::op(ret_left, data[l++]); l >>= 1, r >>= 1; } return Monoid::op(ret_left, ret_right); } inline void update(int i, const value_type &x){ i += hsize; data[i] = x; while(i > 1) i >>= 1, data[i] = Monoid::op(data[i << 1 | 0], data[i << 1 | 1]); } template <typename T> inline void init_with_vector(const std::vector<T> &val){ data.assign(size + 1, Monoid::id()); for(int i = 0; i < (int)val.size(); ++i) data[hsize + i] = val[i]; for(int i = hsize-1; i >= 1; --i) data[i] = Monoid::op(data[i << 1 | 0], data[i << 1 | 1]); } template <typename T> inline void init(const T &val){ init_with_vector(std::vector<value_type>(hsize, val)); } auto debug(){ return data; } }; template <typename T> struct MaxPartialSumMonoid{ struct MaxPartialSum{ T sum, left_max, right_max, partial_max; static auto make(T x){return MaxPartialSum({x, x, x, x});} }; using value_type = std::optional<MaxPartialSum>; constexpr inline static value_type id(){ return std::nullopt; } constexpr inline static value_type op(const value_type &a, const value_type &b){ if(not a) return b; if(not b) return a; return { { a->sum + b->sum, std::max(a->left_max, a->sum + std::max(b->left_max, b->sum)), std::max(b->right_max, b->sum + std::max(a->right_max, a->sum)), std::max({a->partial_max, b->partial_max, a->right_max + b->left_max}) } }; } }; using Mon = MaxPartialSumMonoid<int64_t>; template <typename T, typename U> void chmax(T &a, const U &b){ a = std::max(a, b); } int main(){ int N,Q; scanf("%d%d", &N, &Q); SegmentTree<Mon> seg(N); std::vector<int64_t> a(N); for(int i = 0; i < N; ++i){ scanf("%lld", &a[i]); seg.update(i, Mon::MaxPartialSum::make(a[i])); } for(int i = 0; i < Q; ++i){ std::string com; std::cin >> com; if(com == "set"){ int i, x; scanf("%d%d", &i, &x); --i; seg.update(i, Mon::MaxPartialSum::make(x)); a[i] = x; }else{ int l1, l2, r1, r2; scanf("%d%d%d%d", &l1, &l2, &r1, &r2); --l1, --l2, --r1, --r2; r1 = std::max(l1,r1); l2 = std::min(l2,r2); int64_t ans = LLONG_MIN; auto f = [&](int L1, int L2, int R1, int R2){ auto ret = seg.get(L1, L2+1).value_or(Mon::MaxPartialSum::make(0)).right_max + seg.get(L2+1, R1).value_or(Mon::MaxPartialSum::make(0)).sum + seg.get(R1, R2+1).value_or(Mon::MaxPartialSum::make(0)).left_max; if(L2 == R1) ret -= a[L2]; return ret; }; if(l2 <= r1){ ans = f(l1, l2, r1, r2); }else{ chmax(ans, f(l1, r1, r1, r2)); chmax(ans, f(l1, l2, l2, r2)); chmax(ans, seg.get(r1, l2+1)->partial_max); } printf("%lld\n", ans); } } return 0; }