SRM 597 D2 L2：LittleElephantAndString

#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <iostream>
#include <sstream>
#include <iomanip>

#include <bitset>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>

using namespace std;

#define CHECKTIME() printf("%.2lf\n", (double)clock() / CLOCKS_PER_SEC)

/*************** Program Begin **********************/

class LittleElephantAndString {
public:
bool searchstr(string str, string seastr)// 判断 seastr 是否是 str 的子序列
{
int p1, p2;
p1 = p2 = 0;
for (; p2 < seastr.size(); p2++, p1++) {
for (; p1 < str.size(); p1++) {
if (seastr[p2] == str[p1]) {
break;
}
}
if (p1 == str.size()) {
return false;
}
}
return true;
}
int getNumber(string A, string B) {
int res = 0;
if ( multiset <char> (A.begin(), A.end()) != multiset <char> (B.begin(), B.end()) ) {
return -1;
}
int n = A.size();
res = n;
string nextB;
for (int i = 0; i < n; i++) {
nextB = B.substr(i, n - i);
if (searchstr(A, nextB)) {
res = i;
break;
}
}

return res;
}
};

/************** Program End ************************/