><

AtCoder

IDagc040_a

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

<>>

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$.

Input #2

<>>><<><<<<<>>><

Output #2

API Response (JSON)

{
  "problem": {
    "name": "><",
    "description": {
      "content": "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 satisfie",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc040_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given is a string $S$ of length $N-1$. Each character in $S$ is `<` or `>`.\nA sequence of $N$ non-negative integers, $a_1,a_2,\\cdots,a_N$, is said to be _good_ when the following condition is satisfie...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments