codeforces918C 917A The Monster 【贪心 + 思维枚举】

C. The Monster

time limit per test1 second
memory limit per test256 megabytes

As Will is stuck in the Upside Down, he can still communicate with his mom, Joyce, through the Christmas lights (he can turn them on and off with his mind). He can’t directly tell his mom where he is, because the monster that took him to the Upside Down will know and relocate him.

Thus, he came up with a puzzle to tell his mom his coordinates. His coordinates are the answer to the following problem.

A string consisting only of parentheses (‘(’ and ‘)’) is called a bracket sequence. Some bracket sequence are called correct bracket sequences. More formally:

Empty string is a correct bracket sequence.
if s is a correct bracket sequence, then (s) is also a correct bracket sequence.
if s and t are correct bracket sequences, then st (concatenation of s and t) is also a correct bracket sequence.
A string consisting of parentheses and question marks (‘?’) is called pretty if and only if there’s a way to replace each question mark with either ‘(’ or ‘)’ such that the resulting string is a non-empty correct bracket sequence.

Will gave his mom a string s consisting of parentheses and question marks (using Morse code through the lights) and his coordinates are the number of pairs of integers (l, r) such that 1 ≤ l ≤ r ≤ |s| and the string slsl + 1… sr is pretty, where si is i-th character of s.

Joyce doesn’t know anything about bracket sequences, so she asked for your help.

Input

The first and only line of input contains string s, consisting only of characters ‘(‘, ‘)’ and ‘?’ (2 ≤ |s| ≤ 5000).

Output

Print the answer to Will’s puzzle in the first and only line of output.

Examples

input

((?))

output

4

input

??()??

output

7

Note

For the first sample testcase, the pretty substrings of s are:

“(?” which can be transformed to “()”.
“?)” which can be transformed to “()”.
“((?)” which can be transformed to “(())”.
“(?))” which can be transformed to “(())”.
For the second sample testcase, the pretty substrings of s are:

“??” which can be transformed to “()”.
“()”.
“??()” which can be transformed to “()()”.
“?()?” which can be transformed to “(())”.
“??” which can be transformed to “()”.
“()??” which can be transformed to “()()”.
“??()??” which can be transformed to “()()()”.

题意： 给你一个字符串，其中由’(‘,’)’,’?’构成，其中’?’可以变成另外两个，求有多少个子串满足 可以通过括号匹配，其中‘？’可以代表左右括号

分析： 我们可以暴力枚举两端点，用temp变量保存变化量，分别自左往右，和自右往左各扫一遍，自左往右时：遇到’?’或者’(‘，temp加一，否则减一，如果当前temp小于零说明遇到")" 或 "())" 或"?))"等等这种不满足的字符串直接break，从下一个开始枚举，否则，我们用vis数组记录下当前可行，当然自右往左反过来即可，最后只有当字符串为正反都可行时才满足条件

参考代码

#include <bits/stdc++.h>

using namespace std;

const int maxn = 5e3 + 10;

int vis[maxn][maxn];

int main() {
    string s;cin>>s;
    int len = s.size();
    int res = 0;
    for(int i = 0;i < len;i++) {
        int temp = 0;
        for(int j = i;j < len;j++) {
            if(s[j] == '(' || s[j] == '?')
                temp++;
            else temp--;
            if(temp >= 0) vis[i][j]++;
            else break;
        }
    }

    for(int i = len - 1;i >= 0;i--) {
        int temp = 0;
        for(int j = i;j >= 0;j--) {
            if(s[j] == ')' || s[j] == '?') {
                temp++;
            } else {
                temp--;
            }
            if(temp >= 0) vis[j][i]++;
            else break;
        }
    }
    for(int i = 0;i < len;i++) {
        for(int j = 0;j < len;j++) {
            if((i + j) % 2 && vis[i][j] == 2) {
                res++;
            }
        }
    }
    cout<<res<<endl;
    return 0;
}

• 如有错误或遗漏，请私聊下UP，thx