ACM (UVa) : 10340


Two character array, each length of more than 10000, it would be 100000
char s [100000] and t [100000]
for taking inputs, use scanf () or cin.

We r dealing with finding sub-sequences, which means we have to consider the character order.

For example, “sync” is not a subsequences of “sycn”

VERDI” is a subsequences of “vivaVittorioEmanueleReDiItalia”

Critical input:
verdi abcvedrd
veeri veri

Critical output:
No
No

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s