题目链接
沈阳区域赛
搜索加剪枝
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 250000 + 10;
struct node{
int pos, len;
};
char a[N],ans[N];
int vis[N];
queue<node> q;
int main()
{
int t;
scanf("%d",&t);
int num =
题目链接
沈阳区域赛
搜索加剪枝
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 250000 + 10;
struct node{
int pos, len;
};
char a[N],ans[N];
int vis[N];
queue<node> q;
int main()
{
int t;
scanf("%d",&t);
int num =