For the below testcase, what should be the output :
(()())()(())()()())())()((()(()(())()()())((()(())()(()()()()))()(())()(((()())()(()((())()(())(()))
My answer is :
No of substring = 7
length of longest sequence = 18
Can anyone confirm because I feel codeforces test case is wrong here.?
My code : https://codeforces.com/contest/5/submission/79013600
Hey, I know this is really late, but did you find a solution for this test case? I am getting 72 1 as the answer. Even though I didn't manually count it, I feel like the test case might be faulty. Please let me know. My submission: https://codeforces.com/contest/5/submission/270195826