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 {
    static int cons[] = new int[500001];
    static int ans[] = new int[500001];
    public static void main(String args[]) {
        
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int n = s.length();

        if (s.charAt(n - 1) == '>') {
            cons[n - 1] = 1;
        } else {
            cons[n - 1] = 0;
        }

        for (int i = n - 2; i >= 0; i--) {
            if (s.charAt(i) == '>' && s.charAt(i + 1) == '>') {
                cons[i] = cons[i + 1] + 1;
            } else {
                cons[i] = 1;
            }
        }

        if (s.charAt(0) == '<') {
            ans[0] = 0;
        } else {
            ans[0] = cons[0];
        }
        for (int i = 1; i < n; i++) {
            if (s.charAt(i) == s.charAt(i - 1)) {
                if (s.charAt(i) == '<') {
                    ans[i] = ans[i - 1] + 1;
                } else {
                    ans[i] = cons[i];
                }
            } else {
                if (s.charAt(i) == '<') {
                    ans[i] = 0;
                } else {
                    ans[i] = Math.max(ans[i - 1] + 1, cons[i]);
                }
            }
        }

        if (s.charAt(n - 1) == '>') {
            ans[n] = 0;
        } else {
            ans[n] = ans[n - 1] + 1;
        }

        int result = 0;
        for (int i = 0; i <= n; i++) {
            result += ans[i];
        }
        System.out.println(result);
    }

}