题意:给你两个字符串s和t,每次你可以从完整的s串中任意截取一段连续的串接上去(接之前可以翻转一下),问你最少需要截取多少次可以构成串t,输出每次截取的起点x和终点y,若x < y说明截取后直接接后面,x > y说明接之前先翻转。
还以为3层时间复杂度会T,一直YY2层的算法。
思路:暴力模拟匹配,正着反着各扫一遍匹配。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (2100+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 10007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
char s[MAXN], ss[MAXN], t[MAXN];
int ans[MAXN][2];
int main()
{
Rs(s); Rs(t);
strcpy(ss, s); strrev(ss);
int ls = strlen(s); int lt = strlen(t);
int num = 0;
for(int i = 0; i < lt;)
{
int nextpos = -1; int p1, p2;
for(int j = 0; j < ls; j++)
{
int k = j; int next = i;
while(next < lt && s[k] == t[next]) next++, k++;
//next--;
if(next > nextpos) {nextpos = next, p1 = j+1, p2 = k;}
}
for(int j = 0; j < ls; j++)
{
int k = j; int next = i;
while(next < lt && ss[k] == t[next]) next++, k++;
//next--;
if(next > nextpos) {nextpos = next, p1 = ls-j, p2 = ls-k+1;}
}
if(i == nextpos) {Pi(-1); return 0;}
i = nextpos; ans[num][0] = p1, ans[num++][1] = p2;
}
Pi(num);
for(int i = 0; i < num; i++)
printf("%d %d\n", ans[i][0], ans[i][1]);
return 0;
}