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 Rust (1.15.1) (judge verdict: Accepted)

use std::cmp;
#[allow(dead_code)]
fn read_as_string() -> String {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().to_string()
}

fn main() {
    let s = read_as_string().chars().collect::<Vec<char>>();
    let n = s.len() + 1;

    let mut v = vec![0; n];
    let mut acc: u64 = 0;

    for i in 1..n {
        if s[i - 1] == '<' {
            acc += 1;
        } else {
            acc = 0;
        }
        v[i] = acc;
    }
    acc = 0;
    for i in (0..n - 1).rev() {
        if s[i] == '>' {
            acc += 1;
        } else {
            acc = 0;
        }
        v[i] = cmp::max(v[i], acc);
    }
    println!("{}", v.into_iter().sum::<u64>());
}