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++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <map>
#include <functional>
#include <cmath>
#include <cstdint>
#include <mutex>
#include <thread>

using namespace std;


int main()
{
	string s;
	unsigned int sum = 0;
	unsigned int num[2*100000+1];
	int i, j, k;
	cin >> s;
	
	if (s[0] == '<')
	{
		num[0] = 0;
		num[1] = 1;
	}
	else
	{
		num[0] = 1;
		num[1] = 0;
	}

	for (i = 1; i < s.size() ; i++)
	{
		if (s[i] == '<')
		{
			num[i + 1] = num[i] + 1;
		}
		else
		{
			if (num[i] == 0)
			{
				num[i + 1] = 0;
				for (j = i; j >= 0; j--)
				{
					if (s[j] == '>')
					{
						if (!(num[j] > num[j + 1]))
						{
							num[j] ++;
						}
					}
					else
					{
						break;
					}
				}
			}
			else
			{
				num[i + 1] = 0;
			}
		}
	}
	for (i = 0; i < s.size() + 1; i++)
	{
		sum += num[i];
	}
	cout << sum;

	return 0;
}