Hallelujah520的博客

Lulu has a sweet tooth. Her favorite food is ring donut. Everyday she buys a ring donut from the same bakery. A ring donut is consists of nn parts. Every part has its own sugariness that can be express

Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], …… , a[K

You should process m queries over a set D of strings. Each query is one of three kinds:Add a string s to the set D. It is guaranteed that the string s was not added before. Delete a string s from the