Submission #1453459

---

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<int>
#define rs resize
const int N = 100009;
vector<vi> v(26);
int main()
{
   std::ios::sync_with_stdio(false);
   string a;
   int i,n,j,k,sz,len;
   bool flag = false;
   cin>>a;
   n = a.length();
   rep(i,0,n) v[a[i]-'a'].pb(i);
   for(k=0;k<26 and !flag;k++)
   {
      sz =  v[k].size();
      for(i=0;i<sz and !flag;i++)
       for(j=i+1;j<sz and !flag;j++)
       {
          len = v[k][j] - v[k][i] + 1;
          if(j - i + 1 > len/2)
           flag = true;
       }
   }
   if(flag)
    cout<<v[k - 1][i - 1] + 1<<" "<<v[k - 1][j - 1] + 1;
   else
    cout<<-1<<" "<<-1;
   return 0;
}

Submission Info

Judge Result