zoukankan      html  css  js  c++  java
  • Educational Codeforces Round 65 (Rated for Div. 2) D. Bicolored RBS

    链接:https://codeforces.com/contest/1167/problem/D

    题意:

    A string is called bracket sequence if it does not contain any characters other than "(" and ")". A bracket sequence is called regular (shortly, RBS) if it is possible to obtain correct arithmetic expression by inserting characters "+" and "1" into this sequence. For example, "", "(())" and "()()" are RBS and ")(" and "(()" are not.

    We can see that each opening bracket in RBS is paired with some closing bracket, and, using this fact, we can define nesting depth of the RBS as maximum number of bracket pairs, such that the 22-nd pair lies inside the 11-st one, the 33-rd one — inside the 22-nd one and so on. For example, nesting depth of "" is 00, "()()()" is 11 and "()((())())" is 33.

    Now, you are given RBS ss of even length nn. You should color each bracket of ss into one of two colors: red or blue. Bracket sequence rr, consisting only of red brackets, should be RBS, and bracket sequence, consisting only of blue brackets bb, should be RBS. Any of them can be empty. You are not allowed to reorder characters in ss, rr or bb. No brackets can be left uncolored.

    Among all possible variants you should choose one that minimizes maximum of rr's and bb's nesting depth. If there are multiple solutions you can print any of them.

    思路:

    双指针往后跑就行了,每次变一个颜色。

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    const int MAXN = 2e5+10;
    int res[MAXN];
    
    int main()
    {
        int n;
        string s;
        cin >> n >> s;
        int color = 0;
        int l = 0, r = 0;
        while (s[r] != ')')
            r++;
        int cnt = 0;
        while (cnt < n)
        {
            res[l++] = color;
            res[r++] = color;
            cnt += 2;
            while (l < n && s[l] != '(')
                l++;
            while (r < n && s[r] != ')')
                r++;
            color ^= 1;
        }
        for (int i = 0;i < n;i++)
            cout << res[i];
        cout << endl;
    
        return 0;
    }
    

      

  • 相关阅读:
    位运算简介以及常用技巧
    JMeter 十六:加密处理
    JMeter 十五:函数以及变量
    JMeter 十四:最佳实践
    JMeter 十三:生成 report dashboard
    JMeter 十二:命令行执行
    JMeter 十一:参数化
    JMeter 十:录制脚本--使用bodboy
    LoadRunner录制:检查点
    LoadRunner录制: 选择协议
  • 原文地址:https://www.cnblogs.com/YDDDD/p/10900276.html
Copyright © 2011-2022 走看看