A868.Dancing Lessons

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

There are nn people taking dancing lessons. Every person is characterized by his/her dancing skill aia_{i} . At the beginning of the lesson they line up from left to right. While there is at least one couple of a boy and a girl in the line, the following process is repeated: the boy and girl who stand next to each other, having the minimal difference in dancing skills start to dance. If there are several such couples, the one first from the left starts to dance. After a couple leaves to dance, the line closes again, i.e. as a result the line is always continuous. The difference in dancing skills is understood as the absolute value of difference of aia_{i} variable. Your task is to find out what pairs and in what order will start dancing.

输入格式

The first line contains an integer nn ( 1<=n<=21051<=n<=2·10^{5} ) — the number of people. The next line contains nn symbols B or G without spaces. B stands for a boy, G stands for a girl. The third line contains nn space-separated integers aia_{i} ( 1<=ai<=1071<=a_{i}<=10^{7} ) — the dancing skill. People are specified from left to right in the order in which they lined up.

输出格式

Print the resulting number of couples kk . Then print kk lines containing two numerals each — the numbers of people forming the couple. The people are numbered with integers from 11 to nn from left to right. When a couple leaves to dance you shouldn't renumber the people. The numbers in one couple should be sorted in the increasing order. Print the couples in the order in which they leave to dance.

输入输出样例

  • 输入#1

    4
    BGBG
    4 2 4 3
    

    输出#1

    2
    3 4
    1 2
    
  • 输入#2

    4
    BBGG
    4 6 1 5
    

    输出#2

    2
    2 3
    1 4
    
  • 输入#3

    4
    BGBB
    1 1 2 3
    

    输出#3

    1
    1 2
    
首页