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: Wrong Answer)

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
 
using namespace std;
 
int main(){
string S; cin>>S;
vector<int> sequence;
int sum=0;
for(int i=0;i<S.size();i++){
    int count=0;
    if(S.at(i)=='>'){
        int j=i;
        while(j<S.size()){
          if(S.at(j) =='<')break;
          count++;
          j++;
        }
        if(i != 0){
            if(S.at(i-1)=='<')sequence.push_back(max(sequence[i-1]+1,count));
          else sequence.push_back(count);
        }
        else sequence.push_back(count);
    }else if(i != 0 ){
        if(S.at(i-1)=='>')sequence.push_back(0);
        else sequence.push_back(sequence[i-1]+1);
    }else{
        sequence.push_back(0);
    }
  if(i==S.size()-1){
    if(S.at(i)=='<')  sequence.push_back(sequence[i]+1);;

  }
}

for(int i;i<sequence.size();i++){
  //cout<<i<<" "<<sequence[i]<<endl;
    sum+=sequence[i];
}

cout<<sum<<endl;
}