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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String line = sc.next();
		int len = line.length();
		int[] arr = new int[len + 1];
		int seen = 0;
		int samesCon = 0;
		for (int i = 1; i < len; i++) {
			//おなじ
			if (line.charAt(i - 1) == line.charAt(i)) {
				samesCon++;
			}
			//ちがう
			if (line.charAt(i - 1) != line.charAt(i)) {
				int right =i;
				char target = line.charAt(i - 1);
				if (target == '<') {
					int num = 0;
					for (int j = seen; j <= right; j++) {
						if (arr[j] <= num) {
							arr[j] = num;
							num++;
						}
					}
				} else if (target == '>') {
					int num = 0;
					for (int j = right ; j >= seen; j--) {
						if (arr[j] <= num) {
							arr[j] = num;
							num++;
						}
					}
				}
				seen = right;
				samesCon = 0;
			}
			//終端
			if (i == len - 1) {
				int right =i + 1;
				char target = line.charAt(i);
				if (target == '<') {
					int num = 0;
					for (int j = seen; j <= right; j++) {
						if (arr[j] <= num) {
							arr[j] = num;
							num++;
						}
					}
				} else if (target == '>') {
					int num = 0;
					for (int j = right ; j >= seen; j--) {
						if (arr[j] <= num) {
							arr[j] = num;
							num++;
						}
					}
				}
			}
		}

		int sum =0;
		for (int i : arr) {
			sum += i;
		}

		System.out.println(sum);
	}

}