The Monster (Codeforces Round #459 (Div. 2))

Codeforces Round #459 (Div. 2)The Monster[匹配问题]

原创 2018年01月30日 15:20:19

• 
  

C. The Monster

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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:

1. "(?" which can be transformed to "()".
2. "?)" which can be transformed to "()".
3. "((?)" which can be transformed to "(())".
4. "(?))" which can be transformed to "(())".

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

1. "??" which can be transformed to "()".
2. "()".
3. "??()" which can be transformed to "()()".
4. "?()?" which can be transformed to "(())".
5. "??" which can be transformed to "()".
6. "()??" which can be transformed to "()()".
7. "??()??" which can be transformed to "()()()".

遍历字符串i-j区间，

1)  s[i]=='(' , l++;

2)  s[i]=='?', l--, r++;

3) s[i]==')', l--;

if(l==0)说明此时恰好匹配 cnt++；

if(l<0&&r>0) l+=2, r--;(此时')'+'?'多, 且'?'大于0；则需将'?'改为'(', 然后继续匹配)；

if(l>0) (此时'('多， 可以继续匹配)；

if(l<0&&r==0) 此时')'多， 且没有多余的'?'转化为'('， 则此时一定无法匹配成功， 结束匹配；

#include <iostream>
#include <stack>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;
stack<char> sta;
int main(){
	string s;
	cin >> s;
	int len=s.size();
	int l, r, m, flag;
	int cnt=0;
	for(int i=0; i<len; i++){
		l=r=0;
		for(int j=i; j<len; j++){
			if(s[j]=='(') l++;
			else if(s[j]==')') l--;
			else r++, l--;
			if(l==0) cnt++;
			else if(l<0&&r>0) r--, l+=2;
			else if(l>0) continue;
			else if(l<0&&r==0) break;
		}
	}
	cout << cnt;
	return 0;
}