2021/01/27训练总结

前言

昨天训练一场GYM链接,AC了8题，还剩A,C,E,G,H。E是计算几何，所以暂无补题计划。

A. Two Subsequences

题目链接:Two Subsequences
题目大意:给定一个长度为$n$的全排列，将其拆分为两个上升序列，要求这两个上升序列的长度差最大。如果不能拆分为两个上升序列，输出$-1$
数据范围：$n\le 5\ast 10^5$
题解:思维题，我们考虑拆分的序列为$A,B,A[posa]$为$A$的最后一个元素，$B[posb]$为$B$的最后元素,我们写下如下的程序。

for (int i = 1; i <= n; i++)
	{
		if (a[i] > A[posa])A[++posa] = a[i];
		else
		{
			if (a[i] > B[posb])B[++posb] = a[i];
			else
			{
				printf("-1\n"); exit(0);
			}
		}
	}
	ansmn += min(posa, posb);
	ansmx += max(posa, posb);
	printf("%d\n", ansmx - ansmn);

但测试数据

7
1 2 3 7 4 5 6

会导致

A=1,2,3,7
B=4,5,6

原因就是7和4,5,6都可以接在1,2,3后面，而我们贪心的直接将7接在1,2,3后面了，即我们需要在a[i] > A[posa]&&(a[i] > B[posb]时进行特判，看是否后面的元素接A还是接B。如果1-A[posa]已经全部在A数组和B数组里面了，说明后面的元素与前面的元素相当于没关系的两段。我们可以递归的解决这个问题，具体还是看代码吧。
AC代码:

#include<bits/stdc++.h>

#define ld long double
#define ll long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 500000 + 10;
const int mod = 1e9 + 7;
int n, a[N];
int A[N], B[N],sum[N];
int ansmn, ansmx;
void add(int x) 
{
	for (int i = x; i <= n; i += (i & -i))sum[i]++;
}
int query(int x)
{
	int ans = 0;
	for (int i = x; i; i -= (i & -i))ans += sum[i];
	return ans;
}
void find(int st)
{
	int posa = 0, posb = 0;
	for (int i = st; i <= n; i++)
	{
		if (a[i] > A[posa] && a[i] > B[posb])
		{
			if (query(A[posa]) == A[posa] && i != st)
			{
				find(i);
				break;
			}
		}
		if (a[i] > A[posa])A[++posa] = a[i];
		else
		{
			if (a[i] > B[posb])B[++posb] = a[i];
			else
			{
				printf("-1\n"); exit(0);
			}
		}
		add(a[i]);
	}
	ansmn += min(posa, posb);
	ansmx += max(posa, posb);
}
int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("test.in", "r", stdin);
#endif // ONLINE_JUDGE
	read(n);
	for (int i = 1; i <= n; i++)read(a[i]);
	find(1);
	printf("%d\n", ansmx - ansmn);

	return 0;
}

C. Median Walk

题目链接:Median Walk
题目大意:待补
数据范围：待补
题解:待补
AC代码:

G. Strange Queries

题目链接:Strange Queries
题目大意:$n$个串，$q$次询问，每次询问给出$l,r$两个串，询问$n$个串中有多少个串满足以$l$为前缀$or$以$r$为后缀
数据范围：串长加起来不超过$1e5$
题解:我们将查询离线，然后用两个字典树来存储$l_i$和$r_i$,然后将$n$个原串丢进去查询即可，具体看下代码。
AC代码:

#pragma G++ optimize(2)
#include<bits/stdc++.h>

#define ld long double
#define ll long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 400000 + 10;
const int mod = 1e9 + 7;
int n,q,ans[N];
string s[N],l,r;
map<string, int>Pre,Suf,cnt;
struct Trie
{
	int nxt[N][26],tot=0;
	vector<int>id[N];
	void insert(string& s,int idt)
	{
		int n = s.size();
		int now = 0;
		for (int i = 0; i < n; i++)
		{
			if (!nxt[now][s[i]])nxt[now][s[i]] = ++tot;
			now = nxt[now][s[i]];
		}
		id[now].push_back(idt);
	}
	vector<int>query(string& s)
	{
		vector<int>ans;
		int n = s.size(); int now = 0;
		for (int i = 0; i < n; i++)
		{
			if (!nxt[now][s[i]])return ans;//如果没有匹配了，直接返回
			now = nxt[now][s[i]];
			if (id[now].size())ans.push_back(now);//看是否匹配到一个字符串
		}
		return ans;
	}
}Triepre,Triesuf;
bool vis[N];
void find(string s,int num)
{
	vector<int> anss ;
	vector<int>pans;
	pans = Triepre.query(s);
	for (auto it : pans)
	{
		for (auto it2 : Triepre.id[it])
		{
			if(!vis[it2])
			anss.push_back(it2), vis[it2] = 1,ans[it2]+=num;
		}
	}
	reverse(s.begin(), s.end());
	pans = Triesuf.query(s);
	for (auto it : pans)
	{
		for (auto it2 : Triesuf.id[it])
		{
			if (!vis[it2])
				anss.push_back(it2), vis[it2] = 1, ans[it2]+=num;
		}
	}
	
	for (auto it : anss)vis[it] = 0;
}
int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("test.in", "r", stdin);
#endif // ONLINE_JUDGE
	read(n);
	for (int i = 1; i <= n; i++)
	{
		cin >> s[i];
		cnt[s[i]]++;
	}
	read(q);
	for (int i = 1; i <= q; i++)
	{
		cin >> l >> r;
		Triepre.insert(l,i);
		reverse(r.begin(), r.end());
		Triesuf.insert(r,i);
	}
	for (auto it : cnt)
		find(it.first, it.second);
	for (int i = 1; i <= q; i++)
	{
		printf("%d\n", ans[i]);
	}
	return 0;
}

H. Optimize DFS

题目链接:Optimize DFS
题目大意:待补
数据范围：待补
题解:待补
AC代码: