zoukankan      html  css  js  c++  java
  • Snow Footprints CodeForces

    There is a straight snowy road, divided into n blocks. The blocks are numbered from 1 to n from left to right. If one moves from the i-th block to the (i + 1)-th block, he will leave a right footprint on the i-th block. Similarly, if one moves from the i-th block to the (i - 1)-th block, he will leave a left footprint on the i-th block. If there already is a footprint on the i-th block, the new footprint will cover the old one.

    At the beginning, there were no footprints. Then polar bear Alice starts from the s-th block, makes a sequence of moves and ends in the t-th block. It is known that Alice never moves outside of the road.

    You are given the description of Alice's footprints. Your task is to find a pair of possible values of s, t by looking at the footprints.

    Input

    The first line of the input contains integer n (3 ≤ n ≤ 1000).

    The second line contains the description of the road — the string that consists of n characters. Each character will be either "." (a block without footprint), or "L" (a block with a left footprint), "R" (a block with a right footprint).

    It's guaranteed that the given string contains at least one character not equal to ".". Also, the first and the last character will always be ".". It's guaranteed that a solution exists.

    Output

    Print two space-separated integers — the values of s and t. If there are several possible solutions you can print any of them.

    Example

    Input
    9
    ..RRLL...
    Output
    3 4
    Input
    11
    .RRRLLLLL..
    Output
    7 5

    Note

    The first test sample is the one in the picture.

     1 #include<cstdio>
     2 #include<string>
     3 #include<cstring>
     4 #include<iostream>
     5 #include<algorithm>
     6 using namespace std;
     7 typedef long long ll;
     8 
     9 const int INF=100000;
    10 
    11 int main()
    12 {   int n;
    13     cin>>n;
    14     char a[1005];
    15     scanf("%s",a);
    16     int len=strlen(a),rp=INF,rq=-1,lp=INF,lq=-1;
    17     for(int i=0;i<len;i++){
    18         if(a[i]=='R') { rp=min(rp,i); rq=max(rq,i); }
    19         if(a[i]=='L') { lp=min(lp,i); lq=max(lq,i); }
    20     }
    21     bool rf=false,lf=false;
    22     if(rp==INF&&rq==-1) rf=true;
    23     if(lp==INF&&lq==-1) lf=true;
    24     if(rf) cout<<lq+1<<" "<<lp<<endl;
    25     if(lf) cout<<rp+1<<" "<<rq+2<<endl;
    26     if(!rf&&!lf) cout<<rp+1<<" "<<lp<<endl;    
    27 }
  • 相关阅读:
    获取某个文件夹下面的子文件夹(要求是第一级)
    操作手册
    GWT与GXT
    eclipse中出现:The project cannot be built until build path errors are resolved
    eclipse部署项目要做的工作及配置
    如何测试tomcat安装成功
    tomcat的安装及eclipse配置
    配置jdk
    oracle数据库的安装、完全卸载与plsql的安装以及与oracle的连接
    UVA
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/7257982.html
Copyright © 2011-2022 走看看