PYRAMID2-spoj

Revision en4, by ITMO.MansNotHot9, 2017-09-05 21:23:17

This problem from Viet Nam spoj .

Link of this problem : http://vn.spoj.com/problems/PYRAMID2/;

In short : You have a string s only include 2 char '>' or '<'. After 1 second, with every pair like that "><" will become to "<>"

Find the time this operation will end .

Thanks for your help !!!

Limit : Length of the string s <= 1e6 (1000000);

Example : 4

<><>

Output : 1 . Explain this test : After 0 second : <><>

After 1 second : <<>>
Tags spoj

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English ITMO.MansNotHot9 2017-09-05 21:23:17 2 Tiny change: '000000);\nExample ' -> '000000);\n\nExample '
en3 English ITMO.MansNotHot9 2017-09-05 21:22:26 48
en2 English ITMO.MansNotHot9 2017-09-05 21:17:16 15
en1 English ITMO.MansNotHot9 2017-09-05 21:16:24 459 Initial revision (published)