Time Limit: 1000 ms
Memory Limit: 65535 ms
Given a string containing 'a' to 'z' with length N(1<=N<=100000)。
You have two operations:
Q L R : output the length of the longest consecutive non-decreasing subsequence
C L R P : replace each letter from L to R by letter P('a'<=P<='z') 。
in which,1<=L,R<=N.what's more,maybe you should know the fact 'a'<'b'<'c'<...<'z' .
SA10010044 considers it an easy task ,isn't it ?