CSP/信奥赛C++刷题训练：经典例题 - 栈（1）：洛谷P3056 ：[USACO12NOV] Clumsy Cows S

CSP/信奥赛C++刷题训练：经典例题 - 栈（1）：洛谷P3056 ：[USACO12NOV] Clumsy Cows S

题目描述

Bessie the cow is trying to type a balanced string of parentheses into her new laptop, but she is sufficiently clumsy (due to her large hooves) that she keeps mis-typing characters. Please help her by computing the minimum number of characters in the string that one must reverse (e.g., changing a left parenthesis to a right parenthesis, or vice versa) so that the string would become balanced.

There are several ways to define what it means for a string of parentheses t