Submission #287462

#	Time	Username	Problem	Language	Result	Execution time	Memory
287462		Namnamseo	스탬프 수집 (JOI16_ho_t2)	C++17	100 / 100	4 ms	3672 KiB

2016_ho_t2

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;

char s[100010];
ll pj[100010];
ll po[100010];

ll si[100010];
ll so[100010];

int main(){
	int n;
	scanf("%d%s", &n, s+1);
	ll z = 0;
	for(int i=1; i<=n; ++i){
		pj[i] = pj[i-1] + (s[i] == 'J');
		po[i] = po[i-1] + (s[i] == 'O' ? pj[i] : 0);
		if(s[i] == 'I') z += po[i];
	}
	for(int i=n; 1<=i; --i){
		si[i] = si[i+1] + (s[i] == 'I');
		so[i] = so[i+1] + (s[i] == 'O' ? si[i] : 0);
	}
	ll ans = 0;
	for(int i=0; i<=n; ++i){
		ans = max(ans, so[i+1]);
		ans = max(ans, pj[i] * si[i+1]);
		ans = max(ans, po[i]);
	}
	printf("%lld\n", ans + z);
	return 0;
}

Compilation message (stderr)

2016_ho_t2.cpp: In function 'int main()':
2016_ho_t2.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |  scanf("%d%s", &n, s+1);
      |  ~~~~~^~~~~~~~~~~~~~~~~

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