제출 #872673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
872673		vjudge1	Nivelle (COCI20_nivelle)	C++17	0 / 110	2 ms	856 KiB

nivelle

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")

#define tof_io  ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double  long double
#define int     long long
#define pb      push_back

#define all(x)  x.begin(),x.end()
#define endl    '\n'

const int mod = 998244353; //998244353 1e9+7 1e9+9
const int inf = 1e18;
const int N = 1e6 + 23;	
const int lg = 23;
int fac[N];
int inv[N];
int  dnt_pow	(int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
void dnt_bld	(){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
int  dnt_ncr	(int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
bool cmp (pair<int,int> a, pair<int,int> b){ return a.second > b.second; }
int32_t main()
{
	int n;
	cin >> n;
	string s;
	cin >> s;
	int ans = 1;
	int l = 0 , r = 0;
	int cnt = 1;
	int L = 0;
	int R = 0;
	for(int i = 1 ; i < n; i++)
	{
		if(s[i] == s[i-1])
		{
			cnt++;
			r++;
			if(cnt > ans)
			{
				ans = cnt;
				L = l;
				R = r;
			}
		}

		else
		{
			cnt = 1;
			r = i;
			l = i;
		}
	}
	int k = R - L + 1;
	double ans1 = 1 / k;
	double ans2 = 2 / n;
	if(ans1 < ans2)
		cout << L+1 <<' ' << R+1;
	else 
		cout << 1 << ' ' << n;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 17
• Subtask 3: 0 / 13
• Subtask 4: 0 / 25
• Subtask 5: 0 / 48