Problem:
Score : 300 points

Problem Statement

Given is a string S of length N-1.
Each character in S is < or >.

A sequence of N non-negative integers, a_1,a_2,\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \leq i \leq N-1):

If S_i= <: a_i<a_{i+1}

If S_i= >: a_i>a_{i+1}

Find the minimum possible sum of the elements of a good sequence of N non-negative integers.

Constraints

2 \leq N \leq 5 \times 10^5

S is a string of length N-1 consisting of < and >.

Input

Input is given from Standard Input in the following format:

S

Output

Find the minimum possible sum of the elements of a good sequence of N non-negative integers.

Sample Input 1

<>>

Sample Output 1

3

a=(0,2,1,0) is a good sequence whose sum is 3.
There is no good sequence whose sum is less than 3.

Sample Input 2

<>>><<><<<<<>>><

Sample Output 2

28

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;

class Program
{
    static void Main(string[] args)
    {
        //string[] str = Console.ReadLine().Split(' ');//2つ以上のスペース区切り入力の取得
        string str = Console.ReadLine();
        //long A = Int64.Parse(str);
        //int B = int.Parse(str[1]);
        //string[] strHeight = Console.ReadLine().Split(' ');//2つ以上のスペース区切り入力の取得
        //string[] results = new string[N];
        long[] result = new long[str.Length];
        result[0] = 0;
        long min = 0;

        for( int i = 1; i < str.Length; i++ )
        {
            if(str[i] == '<' )
            {
                result[i] = result[i - 1] + 1;
            }
            else if (str[i] == '>')
            {
                result[i] = result[i - 1] - 1;
            }

            if (min > result[i]) min = result[i];
        }

        long sum = 0;
        foreach( var eachone in result )
        {
            sum += (eachone - min);
        }

        Console.WriteLine(sum);
    }
}