欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页  >  web前端

Codeforces Round #282 (Div. 2) c_html/css_WEB-ITnose

程序员文章站 2022-04-09 19:29:24
...
/** * @brief Codeforces Round #282 (Div. 2) c * @file c.cpp * @author mianma * @created 2014/12/16 16:09 * @edited  2014/12/16 16:09 * @type math * @note */#include #include #include #include using namespace std;#define max(a, b)  ((a) > (b) ? (a) : (b))#define min(a, b)  ((a) > (b) ? (b) : (a)) #define abs(a)     ((a) >  0  ? (a) : (0 - (a)))#define CLR(vec)   memset(vec, 0, sizeof(vec))#ifdef DEBUGifstream in;ofstream out;#define CIN in#define COUT out#else#define CIN cin#define COUT cout#endif#define MAXN 100010int ans[MAXN];string str;int last;int tot, cnt;int n;int lft, rht; // '{' and '}'int main(void){    ios_base::sync_with_stdio(0);#ifdef DEBUG    CIN.open("./in",  ios::in);    COUT.open("./out",  ios::out);#endif    CIN >> str;    n = str.size();    for(int i = 0; i  last; i--){        if(')' == str[i])            ++rht;        else            --rht;        if(rht = 1){                    ans[cnt] = lft;                    goto success;                }else                    goto fail;            }            ++cnt;        }        if(lft