CF1569A.Balanced Substring

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You are given a string $s$ , consisting of $n$ letters, each letter is either 'a' or 'b'. The letters in the string are numbered from $1$ to $n$ .

$s[l; r]$ is a continuous substring of letters from index $l$ to $r$ of the string inclusive.

A string is called balanced if the number of letters 'a' in it is equal to the number of letters 'b'. For example, strings "baba" and "aabbab" are balanced and strings "aaab" and "b" are not.

Find any non-empty balanced substring $s[l; r]$ of string $s$ . Print its $l$ and $r$ ( $1 \le l \le r \le n$ ). If there is no such substring, then print $-1$ $-1$ .

输入格式

The first line contains a single integer $t$ ( $1 \le t \le 1000$ ) — the number of testcases.

Then the descriptions of $t$ testcases follow.

The first line of the testcase contains a single integer $n$ ( $1 \le n \le 50$ ) — the length of the string.

The second line of the testcase contains a string $s$ , consisting of $n$ letters, each letter is either 'a' or 'b'.

输出格式

For each testcase print two integers. If there exists a non-empty balanced substring $s[l; r]$ , then print $l$ $r$ ( $1 \le l \le r \le n$ ). Otherwise, print $-1$ $-1$ .

输入输出样例

输入#1

4
1
a
6
abbaba
6
abbaba
9
babbabbaa

输出#1

说明/提示

In the first testcase there are no non-empty balanced subtrings.

In the second and third testcases there are multiple balanced substrings, including the entire string "abbaba" and substring "baba".

首页