#632288 (C++11) No.1433 Two color sequence

提出ソース

結果

問題	No.1433 Two color sequence
ユーザー	leaf_1415
提出日時	2021-03-20 00:51:51
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	32 ms / 2,000 ms
コード長	4,586 bytes
コンパイル時間	1,273 ms
コンパイル使用メモリ	85,980 KB
実行使用メモリ	8,352 KB
最終ジャッジ日時	2024-11-19 03:57:04
合計ジャッジ時間	2,906 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	1 ms 6,816 KB
testcase_03	AC	19 ms 8,232 KB
testcase_04	AC	17 ms 8,252 KB
testcase_05	AC	2 ms 6,816 KB
testcase_06	AC	1 ms 6,816 KB
testcase_07	AC	1 ms 6,816 KB
testcase_08	AC	30 ms 8,192 KB
testcase_09	AC	29 ms 8,304 KB
testcase_10	AC	29 ms 8,084 KB
testcase_11	AC	28 ms 8,176 KB
testcase_12	AC	30 ms 8,224 KB
testcase_13	AC	30 ms 8,228 KB
testcase_14	AC	32 ms 8,236 KB
testcase_15	AC	30 ms 8,336 KB
testcase_16	AC	29 ms 8,288 KB
testcase_17	AC	31 ms 8,256 KB
testcase_18	AC	31 ms 8,232 KB
testcase_19	AC	30 ms 8,320 KB
testcase_20	AC	29 ms 8,352 KB
testcase_21	AC	29 ms 8,176 KB
testcase_22	AC	29 ms 8,348 KB
testcase_23	AC	29 ms 8,304 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll modpow(ll a, ll n){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	else return modpow((a*a)%mod, n/2) % mod;
}


template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) {
		os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}


ll n;
string s;
ll a[200005], sum[200005], m[200005];

ll calc()
{
	rep(i, 1, n) sum[i] = sum[i-1] + a[i];
	rep(i, 1, n) m[i] = min(m[i-1], sum[i]);
	
	ll ret = -inf;
	rep(i, 1, n) chmax(ret, sum[i] - m[i-1]);
	return ret;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> s;
	rep(i, 1, n) cin >> a[i];
	s = "#" + s;
	rep(i, 1, n) if(s[i] == 'R') a[i] *= -1;
	
	ll ans = calc();
	rep(i, 1, n) a[i] *= -1;
	chmax(ans, calc());
	
	outl(ans);
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード