結果

問題 No.865 24時間降水量
ユーザー YDK1727YDK1727
提出日時 2019-08-16 22:44:10
言語 C++14
(gcc 11.2.0 + boost 1.78.0)
結果
AC  
実行時間 66 ms / 2,000 ms
コード長 4,222 bytes
コンパイル時間 1,386 ms
使用メモリ 6,712 KB
最終ジャッジ日時 2022-11-22 09:37:19
合計ジャッジ時間 3,129 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 3 ms
6,608 KB
testcase_01 AC 3 ms
6,508 KB
testcase_02 AC 4 ms
6,648 KB
testcase_03 AC 4 ms
6,616 KB
testcase_04 AC 4 ms
6,504 KB
testcase_05 AC 3 ms
6,520 KB
testcase_06 AC 3 ms
6,608 KB
testcase_07 AC 4 ms
6,668 KB
testcase_08 AC 4 ms
6,704 KB
testcase_09 AC 4 ms
6,612 KB
testcase_10 AC 5 ms
6,516 KB
testcase_11 AC 6 ms
6,588 KB
testcase_12 AC 6 ms
6,580 KB
testcase_13 AC 7 ms
6,516 KB
testcase_14 AC 6 ms
6,568 KB
testcase_15 AC 65 ms
6,620 KB
testcase_16 AC 66 ms
6,712 KB
testcase_17 AC 64 ms
6,520 KB
testcase_18 AC 4 ms
6,576 KB
testcase_19 AC 3 ms
6,508 KB
testcase_20 AC 3 ms
6,660 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
// Begin Header {{{
#define all(x)          x.begin(), x.end()
#define SIZE(x)         static_cast<i64>(x.size())
#define rep(i, n)       for (i64 i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, s, t)   for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define repr(i, s, t)   for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define VAR(Type, ...)  Type __VA_ARGS__; input(__VA_ARGS__)
#define let             const auto

#ifdef DBG
#define trace(...) _internal::_trace(#__VA_ARGS__, __VA_ARGS__);
#else
#define trace(...)
#endif

using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template<class T, class U>inline bool chmax(T &a, const U &b){return b>a && (a=b, true);}
template<class T, class U>inline bool chmin(T &a, const U &b){return b<a && (a=b, true);}
inline i64  sigma(i64 n)                    { return n * (n + 1) >> 1; }
inline i64  divup(i64 a, i64 b)             { return (a + b - 1) / b; }
inline bool inner(i64 a, i64 low, i64 high) { return (low <= a && a < high); }
constexpr int INF  = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;

namespace _internal { // {{{
    template<size_t> struct _Uint{};
    template<class Tuple>
        ostream& _print_tuple(ostream &out, const Tuple &t, _Uint<1>) {
            return out << std::get< std::tuple_size<Tuple>::value - 1 >(t);
        }
    template<class Tuple, size_t Index>
        ostream& _print_tuple(ostream &out, const Tuple &t, _Uint<Index>) {
            out << std::get< std::tuple_size<Tuple>::value - Index >(t) << ' ';
            return _print_tuple(out, t, _Uint<Index-1>());
        }
    template <class T>
        void _trace(const char *s, T&& x) {
            clog << '{';
            while(*s != '\0') clog << *(s++);
            clog << ":" << setw(3) << x << '}' << endl;
        }
    template <class Head, class... Tail>
        void _trace(const char *s, Head&& head, Tail&&... tail) {
            clog << '{';
            while(*s != ',') clog << *(s++);
            clog << ":" << setw(3) << head << "}, ";
            for (++s; !isgraph(*s); ++s);
            _trace(s, std::forward<Tail>(tail)...);
        }
} // }}}

template<class T>
inline void input(T &x) { cin >> x; }

template<class Head, class... Tail>
inline void input(Head &head, Tail&... tail) { cin >> head; input(tail...); }

template<class... Args>
inline void outl(Args&&... args) { cout << make_tuple(std::forward<Args>(args)...) << "\n"; }

ostream& operator<< (ostream &out, ostream&) { return out; }

template<class T>
ostream& operator<< (ostream &out, const vector<T> &vec) {
    rep(i, vec.size()) out << vec[i] << " \n"[i+1 == vec.size()];
    return out;
}

template<class T, class U>
ostream& operator<< (ostream &out, const pair<T, U> &p) {
    return out << p.first << ' ' << p.second;
}

template<class... Types>
ostream& operator<< (ostream &out, const tuple<Types...> &t) {
    return out << _internal::_print_tuple(out, t, _internal::_Uint<sizeof...(Types)>());
}

template<class Itr>
ostream& print(Itr begin, Itr end, const string &separator = " ", ostream &out = cout) {
    const auto rbegin = std::prev(end);
    for (; begin != rbegin; ++begin) out << *begin << separator;
    out << *rbegin;
    return out;
}
// }}} End Header

signed main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N;
    i64 a[200100] {};
    i64 sum[200100] {};

    cin >> N;
    reps(i, 1, N) {
        cin >> a[i];
    }

    {
        i64 s = 0;
        reps(i, 1, 23) s += a[i];

        reps(i, 24, N) {
            s += a[i];
            sum[i - 23] = s;
            s -= a[i - 23];
        }
    }

    let K = N - 23;
    i64 maxv = 0;
    reps(i, 1, K) {
        chmax(maxv, sum[i]);
    }

    trace(K, maxv);

    int Q; cin >> Q;
    while(Q--) {
        VAR(i64, T, V);
        let add = V - a[T];
        a[T] = V;

        reps(i, max<i64>(1, T - 23), T) {
            sum[i] += add;
            chmax(maxv, sum[i]);
        }

        // print(sum, sum + K+1) << endl;

        outl(maxv);
    }

    return 0;
}
0