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

import java.util.*;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		String ss = sc.next();
		int[] res = new int[ss.length()];
		long sum = 0;
		int count = 0;
		boolean flg = true;
		
		int st_num=0;
		
		for(int i=0;i<ss.length();i++){
			if( ss.charAt(i) == '<' ){
				if (flg){
					count++;
				}else{
					if(count<st_num){
						sum+=count*(count-1)/2;
					}else{
						sum+=Math.max((1+count)*count/2- st_num,0);
					}
						
					System.out.println(sum);
					st_num=count;
					flg=false;
					count=1;
				}
				flg=true;
			}else{
				if(flg){
					if(st_num<count){
						sum+=(1+count)*count/2;
						st_num=count;
					}else{
						sum+=(1+count)*count/2;
						st_num=count;
					}
					count=1;
				}else{
					count++;
				}
				flg=false;
			}
		}
		
		if(flg){
			sum+=(1+count)*count/2;
		}else{
			sum+=Math.max((1+count)*count/2- st_num,0);
		}
		
		
		System.out.println(sum);
	}
}