Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Areas on the Cross-Section Diagram

Your task is to simulate a flood damage.

For a given cross-section diagram, reports areas of flooded sections.

Assume that rain is falling endlessly in the region and the water overflowing from the region is falling in the sea at the both sides.
For example, for the above cross-section diagram, the rain will create floods which have areas of 4, 2, 1, 19 and 9 respectively.

Input

A string, which represents slopes and flatlands by '/', '\' and '_' respectively, is given in a line. For example, the region of the above example is given by a string "\\///\_/\/\\\\/_/\\///__\\\_\\/_\/_/\".

output

Report the areas of floods in the following format:

$A$

$k$ $L_1$ $L_2$ ... $L_k$

In the first line, print the total area $A$ of created floods.

In the second line, print the number of floods $k$ and areas $L_i (i = 1, 2, ..., k)$ for each flood from the left side of the cross-section diagram. Print a space character before $L_i$.

Constraints

$1 \leq$ length of the string $\leq 20,000$

Sample Input 1

\\//

Sample Output 1

4
1 4

Sample Input 2

\\///\_/\/\\\\/_/\\///__\\\_\\/_\/_/\

Sample Output 2

35
5 4 2 1 19 9

Solution in C (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>
#define N 20001
typedef struct
{
  int x[2];//position of both side of damage
  int area;
} damage;
void calcDamage(char*);
void push(damage);
damage pop(void);
void printStack(void);
damage stack[N];
int top=0;
int main(void)
{
  char str[N];//input
  scanf("%s",str);
  calcDamage(str);
  printStack();
  return 0;
}
void calcDamage(char *str)
{
  int i;//counter
  int x=0,y=0;//current position
  int p[N];//array of depth
  p[0]=0;
  int mindepth=0;//minimum depth (default: 0)
  damage temp;
  for(x=1;x<=strlen(str);x++)
    {
      switch(str[x-1])
        {
        case '\\':
          y--;
          p[x]=y;
          break;
        case '/':
          y++;
          p[x]=y;
          if(y>mindepth) mindepth=y;
          else
            {
              for(i=x-1;i>=0;i--)
                {
                  if(p[i]==y) break;
                }
              if(i>=0)
                {
                  temp.x[0]=i;
                  temp.x[1]=x;
                  temp.area=((x-i)+(x-i-2))/2;
                  push(temp);
                }
            }
          break;
        case '_':
          p[x]=y;
          break;
        }
    }
}
void push(damage d)
{
  damage p;//poped element
  while(top>0)
    {
      p=pop();
      #ifdef DEBUG
      printf(" pop(top=%d)\n",top);
      #endif
      if(p.x[0]>d.x[0]&&p.x[1]<d.x[1])
        {
          d.area+=p.area;
          #ifdef DEBUG
          printf(" merged->%d,%d,%d\n",d.x[0],d.x[1],d.area);//debugging
          #endif
        }
      else
        {
          push(p);
          #ifdef DEBUG
          printf("push->%d,%d,%d\n",d.x[0],d.x[1],d.area);//debugging
          #endif
          break;
        }
    }
  top++;
  stack[top]=d;
  #ifdef DEBUG
printf("push->%d,%d,%d\n",d.x[0],d.x[1],d.area);//debugging
  #endif
}
damage pop(void)
{
  top--;
  return stack[top+1];
}
void printStack(void)
{
  int i=0;//counter
  int sum=0;//sum of damage
  for(i=1;i<=top;i++) sum+=stack[i].area;
  printf("%d\n",sum);
  printf("%d",top);
  for(i=1;i<=top;i++) printf(" %d",stack[i].area);
  printf("\n");
}