Submission #1453399

---

Source Code Expand

#include<bits/stdc++.h>
#include<sstream>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(i=(ll)a;i<(ll)b;i++)
#define revrep(i,a,b) for(i=(ll)a;i>=(ll)b;i--)
#define strep(it,v) for(it=v.begin();it!=v.end();++it)
#define ii pair<pair<ll,ll>,pair<ll,ll> >
#define MP make_pair
#define pb push_back
#define f first
#define se second
#define ll long long int
#define vi vector<ll>
#define rs resize
const int N = 100009;
int fre[26][N];
int main()
{
   std::ios::sync_with_stdio(false);
   string a;
   int i,h,sz,n,j,k;
   bool flag = false;
   cin>>a;
   n = a.length();
   rep(i,0,n) fre[a[i]-'a'][i+1]++;
   rep(i,0,26)  rep(j,1,N)  fre[i][j]+=fre[i][j-1];
   for(i=0;i<n and !flag;i++)
    for(j=i+1;j<n and !flag;j++)
    {
       sz = j-i+1;
       rep(k,0,26)
       {
          h = fre[k][j+1] - fre[k][i];
          if(h > sz/2)
          {
            flag = true;
            break;
          }
      }
    }
   if(flag)
    cout<<i<<" "<<j;
   else
    cout<<-1<<" "<<-1;
   return 0;
}

Submission Info

Judge Result