CF298A.Snow Footprints

普及-

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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.

有一条笔直的积雪道路,被划分为 nn 个方块。这些方块从左到右编号为 11 到 nn。若某人从第 ii 个方块移动到第 i+1i+1 个方块,则会在第 ii 个方块上留下一个向右的脚印;类似地,若某人从第 ii 个方块移动到第 i−1i-1 个方块,则会在第 ii 个方块上留下一个向左的脚印。如果第 ii 个方块上已存在脚印,则新脚印将覆盖旧脚印。

初始时,所有方块上均无脚印。随后,北极熊 Alice 从第 ss 个方块出发,进行一系列移动,最终停在第 tt 个方块。已知 Alice 的所有移动均未超出道路范围。

你将获得 Alice 留下的脚印描述。你的任务是:仅根据这些脚印,找出一对可能的 s, ts,\,t 值。

输入格式

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.

输入的第一行包含一个整数 $ n (( 3 \leq n \leq 1000 $)。

第二行包含道路的描述——一个由 $ n $ 个字符组成的字符串。每个字符为以下之一:“.”(表示该位置没有脚印)、“L”(表示该位置有一个左脚脚印)、“R”(表示该位置有一个右脚脚印)。

保证给定字符串中至少存在一个不等于 “.” 的字符,且第一个和最后一个字符始终为 “.”。保证存在解。

输出格式

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

输出两个用空格分隔的整数——即 ss 和 tt 的值。如果存在多个可能的解,你可以输出其中任意一个。

输入输出样例

  • 输入#1

    9
    ..RRLL...

    输出#1

    3 4
  • 输入#2

    11
    .RRRLLLLL..

    输出#2

    7 5

说明/提示

The first test sample is the one in the picture.

第一个测试样例是图片中的那个。

输入解题思路,AI测评打分。不知道怎么写?

首页