Hello all :)

Can anyone give some idea or help me to solve this problem here?

It seems like straightforward SP problem, but the constraints are too large to be able to draw the graph. And I'm not really sure, how to use information of intervals to solve the problem.

So if anyone has some idea, please contribute!

Thanks,

minimario

Today, I came back from some class, and I found, like 10 of my post, on the front page. I didn't think I had do anything wrong, perhaps I had accident click something that cause all blog post to be revive. That made me some sort of worried. I spent a while, asked some people, what may be I did wrong that cause so many of my past post to appear on the front page...

But then I check my email, and what I found?

I found, 13 messages of this form in my inbox~~! Then I realise, what has happened: Tanya_Romanova_loves_me comment on each of my old post, then he immediately delete all his messages... So this cause 10 of my post to be on Recent Actions, make me look like crazy man to revive so many post!! So, I guess there is down-side to delete comment function on Codeforces.

So, now, I hate this user. He has made attempt, make me look bad to the Codeforces community. Now I see why, even he make his username Tanya_Romanova_loves_me, Tanya Romanova still does not love him. I think nobody love him, nobody will ever love him~~~

Hello, Codeforces:

I worked on problem 346B for a long time, and I could not come up with solution. Even when I read editorial and comments, the solution is still unclear to me. I know, it is KMP + DP, but I cannot see what KMP should be used on, DP transitions, etc. I know in the dp[i][j][k], i and j represent indices in str1 and str2, and k represents the longest match of the current subsequence and virus, but I cannot really get anything else.

I have worked for a few hours, but I don't have really much progress, and editorial/comments doesn't really help. So if anyone could give a clear explanation of this problem, it would be great and I would much appreciate it.

Thanks,

minimario