Codeforces Round #442 (Div. 2) A B

A. Alex and broken contest time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output One day Alex was creating a contest about his friends, but accidentally deleted it. Fortunately, all the problems were saved, but now he needs to find them among other problems. But there are too many problems, to do it manually. Alex asks you to write a program, which will determine if a problem is from this contest by its name. It is known, that problem is from this contest if and only if its name contains one of Alex’s friends’ name exactly once. His friends’ names are “Danil”, “Olya”, “Slava”, “Ann” and “Nikita”. Names are case sensitive. Input The only line contains string from lowercase and uppercase letters and “_” symbols of length, not more than 100 — the name of the problem. Output Print “YES”, if problem is from this contest, and “NO” otherwise. Examples input Alex_and_broken_contest output NO NikitaAndString YES Danil_and_Olya

You need just implement what is written in the statements. Count the total number of entries of the names and check if it’s equal to 1.

开始没有注意同一名字出现多次的情况

B. Nikita and string One day Nikita found the string containing letters “a” and “b” only. Nikita thinks that string is beautiful if it can be cut into 3 strings (possibly empty) without changing the order of the letters, where the 1-st and the 3-rd one contain only letters “a” and the 2-nd contains only letters “b”. Nikita wants to make the string beautiful by removing some (possibly none) of its characters, but without changing their order. What is the maximum length of the string he can get? The first line contains a non-empty string of length not greater than 5 000 containing only lowercase English letters “a” and “b”. Print a single integer — the maximum possible size of beautiful string Nikita can get. abba 4 bab 2 Note It the first sample the string is already beautiful. In the second sample he needs to delete one of “b” to make it beautiful.

Let prefa[i] be the count of letter “a” in prefix of length i and prefb[i] be the count of letter “b” in prefix of length i.

Let’s fix two positions i and j, 1 ≤ i ≤ j ≤ n, so we remove all “b” from prefix, which ends in i, and suffix, which starts in j, and all “a” between positions i and j. Then length of string is (prefa[n] - prefa[j]) + (prefb[j] - prefb[i]) + (prefa[i]).

Using two for loops we find optimal i and j and calculate answer.