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 : <<>>