#635509 (C++17) No.1433 Two color sequence

• 問題: No.1433 Two color sequence
• ユーザー: TrpFrog
• 提出日時: 2021-03-29 03:06:00
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 91 ms / 2,000 ms
• コード長: 2,333 bytes
• コンパイル時間: 1,789 ms
• コンパイル使用メモリ: 202,392 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-06 23:04:47
• 合計ジャッジ時間: 5,119 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	33 ms; 5,376 KB
testcase_04	AC	33 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	82 ms; 5,376 KB
testcase_09	AC	78 ms; 5,376 KB
testcase_10	AC	76 ms; 5,376 KB
testcase_11	AC	77 ms; 5,376 KB
testcase_12	AC	80 ms; 5,376 KB
testcase_13	AC	82 ms; 5,376 KB
testcase_14	AC	91 ms; 5,376 KB
testcase_15	AC	85 ms; 5,376 KB
testcase_16	AC	83 ms; 5,376 KB
testcase_17	AC	85 ms; 5,376 KB
testcase_18	AC	85 ms; 5,376 KB
testcase_19	AC	82 ms; 5,376 KB
testcase_20	AC	82 ms; 5,376 KB
testcase_21	AC	82 ms; 5,376 KB
testcase_22	AC	81 ms; 5,376 KB
testcase_23	AC	82 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define eb emplace_back
#define unused [[maybe_unused]]
#define tempT template<class T>
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define debug(x) cerr << #x << ": " << x << endl
#define ans_exit(x) { cout << x << endl; exit(0); }
#define ans_return(x) { cout << x << endl; return; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define r_rep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define reps(i, n, m) for (ll i = (ll)(n); i < (ll)(m); i++)
#define r_reps(i, n, m) for (ll i = (ll)(m) - 1; i >= (ll)(n); i--)
#define debugarr(a) {cerr << #a << ":"; \
                    for(auto _e:a){cerr << " " <<_e;} cerr << endl;}

using ll   unused = long long;
using ld   unused = long double;
using vl   unused = vector<ll>;
using vvl  unused = vector<vl>;
using vvvl unused = vector<vvl>;
using lp   unused = pair<ll, ll>;
using lmap unused = map<int, int>;

unused constexpr ll MOD = 998244353;
unused constexpr ll INF = 1 << 29;
unused constexpr ll LINF = 1LL << 61;
unused constexpr int DX[8] = {0, 1, 0,-1, 1, 1,-1,-1};
unused constexpr int DY[8] = {1, 0,-1, 0, 1,-1, 1,-1};
unused inline bool bit(ll b, ll i) { return b & (1LL << i); }
unused inline ll ceiv(ll a, ll b) { return (a + b - 1) / b; }
unused inline ll mod(ll a, ll m = MOD) { return (a % m + m) % m; }
unused inline void modadd(ll &a, ll b, ll m = MOD) { a = mod(a + b, m); }
unused inline ll floordiv(ll a, ll b) { return a / b - (a < 0 && a % b); }
unused inline ll ceildiv(ll a, ll b) { return floordiv(a + b - 1, b); }
tempT unused inline bool in_range(T a, T x, T b) { return a <= x && x < b; }
unused inline bool in_range(ll x, ll b) { return in_range(0LL, x, b); }
tempT unused bool chmin(T &a, T b) { if(a > b) {a = b; return 1;} return 0; }
tempT unused bool chmax(T &a, T b) { if(a < b) {a = b; return 1;} return 0; }

int main() {
    ll n; cin >> n;
    string s; cin >> s;
    vl a(n);
    rep(i, n) {
        cin >> a[i];
        if(s[i] == 'R') a[i] *= -1;
    }
    rep(i, n - 1) {
        a[i + 1] += a[i];
    }

    ll a_max = 0, a_min = 0, ans = -1;
    rep(i, n) {
        chmax(a_max, a[i]);
        chmin(a_min, a[i]);
        chmax(ans, max(abs(a[i] - a_max), abs(a[i] - a_min)));
    }

    cout << ans << endl;
}