제출 #122246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122246		Retro3014	스탬프 수집 (JOI16_ho_t2)	C++17	100 / 100	7 ms	768 KiB

2016_ho_t2

#include <bits/stdc++.h>

#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL


using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N;
string str;
ll ans = 0;
ll J = 0, I = 0;
ll ans2;

int main(){
	cin>>N;
	cin>>str;
	ll A=0, B=0;
	for(int i=0; i<N; i++){
		if(str[i]=='J'){
			J++;
			A++;
		}else if(str[i]=='O'){
			B+=A;
		}else{
			I++;
			ans2 += B;
		}
	}
	ans = max(ans, B);
	A = B = 0;
	ll i=0, j=0;
	for(int t=N-1; t>=0; t--){
		if(str[t]=='I'){
			i++;
			A++;
		}else if(str[t]=='O'){
			B+=A;
		}else{
			j++;
		}
		ans = max(ans, i * (J-j));
	}
	ans = max(ans, B);
	cout<<ans + ans2;
	return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 20 / 20
• Subtask 3: 50 / 50