In D div2, is the case s[i] == t[j + 1] && adding both of them to the subsequence concluded?

Auto comment: topic has been updated by AFatWolf (previous revision, new revision, compare).

Shit, my bad :P . But if the statement change to counting what the maximum point u can reach will there be any solution ?

hmm....might be... any way I still feel the solution is wrong :P

I thought it was greesy when they choose the point nearest to point 0?

Could u please go for more detail about it?? I have difficulty in reading and understanding ur code :P

I've been doing F and my code got Runtime_error after cout the output nad I dont know why. Here's my code: http://mirror.codeforces.com/contest/670/submission/17828267 Anyone can help, pls?? P/s: my English is not good sry if u mind.