298A - Snow Footprints - CodeForces Solution

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <map>

#define test_case int t;cin>>t;while(t--)
#define ll long long
#define endl "\n"
#define all(v) v.begin(),v.end()

using namespace std;

void fast()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

string base_converter(ll x,ll y)
{
    char buffer [33];
    itoa (x,buffer,y);
    string s=buffer;
    return s;
}
string findSum(string str1, string str2)
{
    // Before proceeding further, make sure length
    // of str2 is larger.
    if (str1.length() > str2.length())
        swap(str1, str2);

    // Take an empty string for storing result
    string str = "";

    // Calculate length of both string
    int n1 = str1.length(), n2 = str2.length();

    // Reverse both of strings
    reverse(str1.begin(), str1.end());
    reverse(str2.begin(), str2.end());

    int carry = 0;
    for (int i=0; i<n1; i++)
    {
        // Do school mathematics, compute sum of
        // current digits and carry
        int sum = ((str1[i]-'0')+(str2[i]-'0')+carry);
        str.push_back(sum%10 + '0');

        // Calculate carry for next step
        carry = sum/10;
    }

    // Add remaining digits of larger number
    for (int i=n1; i<n2; i++)
    {
        int sum = ((str2[i]-'0')+carry);
        str.push_back(sum%10 + '0');
        carry = sum/10;
    }

    // Add remaining carry
    if (carry)
        str.push_back(carry+'0');

    // reverse resultant string
    reverse(str.begin(), str.end());

    return str;
}

long long gcd(long long a, long long b) {
    return a ? gcd(b % a, a) : b;
}
long long lcm(long long a, long long b) {
    return a / gcd(a, b) * b;
}

long long fact(long long n) {
    long long f = 1;
    for (int i = 2; i <= n; i++)
    {
        f *= i;
    }
    return f;
}
long long ncr(long long n, long long r) {
    return fact(n) / (fact(r) * fact(n - r));
}
long long npr(long long n, long long r) {
    return fact(n) / fact(n - r);
}

bool prime (long long x)
{
    long long i=2;
    bool ch=true;
    if (x==1)
        ch=false;
    while (x>=i*i)
    {
        if (x%i==0)
        {
            ch=false;
            break;
        }
        i++;
    }
    if (ch==false)
    {
        return false;
    }
    else
        return true;
}


int main()
{
int f=0 , l = 0;
    int size ; cin >> size ;
    string str ; cin >> str ;
    for(int i=0 ; i<size ;i++) {
        if (str[i] != '.') {
            f = i;
            break;
        }
    }
    for(int i=size-1 ; i>=0 ;i--) {
        if (str[i] != '.') {
            l = i;
            break;
        }
    }

    if(str[f]==str[l] and str[l]=='R')
        cout << f+1 << " " << l+1+1 ;
    else if(str[f]==str[l] and str[l]=='L')
        cout << l+1 << " " << f ;
    else
    {
        for(int i=f ; i<size ; i++)
        {
            l = i ;
            if(str[i]=='L')
                break;
        }
        cout << ++f << " " << l ;
    }
}