2019.8.5 JZ DAY5总结-CSDN博客

博主分享了2019年8月5日JZ考试的个人总结，提到在T1题目中因将简单问题复杂化导致困扰，实际上利用等差数列性质可轻松解题；T2题目中由于误用MLE方法，正解应使用线段树；T3题目因小错误仅得低分，正确做法是在拓展超限后输出特定答案。尽管遇到挫折，博主表示会继续努力。

唉，都怪我第一天立下的flag，含着泪也要补齐总结【掩面】
十分抱歉，由于题面又是一张张图片，迫于无奈（懒）只能再一次不放题面了。

$T 1$

一道世纪大水题，我却想了很久很久都没想出来，我虽然知道这道题真的很简单，可是就是因为考场就是一棵树上吊死，没有考虑过其他做法。我以为是道数据结构题，结果是到数学题。用到等差数列的性质可以极为简单地A穿这道题。先处理好纵，然后处理横。由于c++的字符串输入输出真的是让人头大，所以就连40pts的暴力都没拿到。

#include <iostream>
#include <cstdio>
using namespace std;

const int N = 1e6 + 100;
const int mo = 1e9 + 7;
int n,m,k,r[N],s[N],sum,ans,sums;

int main()
{
	freopen("game.in","r",stdin);
	freopen("game.out","w",stdout);
	scanf("%d%d%d",&n,&m,&k);
	for (int i = 1; i <= N - 90; i ++) r[i] = s[i] = 1;
	for (int i = 1; i <= k; i ++)
	{
		char ch;
		int x,y;
		scanf(" %c%d%d",&ch,&x,&y);
		if (ch == 'R') r[x] = (1ll * r[x] * y) % mo;
		else s[x] = (1ll * s[x] * y) % mo;
	}
	for (int i = 1; i <= m; i ++)
		sum = (1ll * sum + (1ll * i * s[i]) % mo) % mo,sums = (1ll * sums + 1ll * s[i]) % mo;
	ans = (1ll * sum * r[1]) % mo;
	for (int i = 2; i <= n; i ++)
		ans = (1ll * ans + (1ll * (i - 1) * sums % mo * m % mo + sum) % mo * r[i] % mo) % mo;
	printf("%d",ans);
	return 0;
}

$T 2$

由于惯性思维，我考虑用倍增，然后就码了一个MLE的优美（丑陋）倍增，因为倍增的话数组要开的极大无比，正解可以用线段树，海星。

#include <cstdio>
#include <cstring>
using namespace std;

const int N = 2010;
int n,m,Q,X,Y,v[N][N],tov[N << 4][N],xu[N],len;

int px(int x) {if (x == 0) return n; if (x == n + 1) return 1; return x;}
int py(int y) {if (y == 0) return m; if (y == m + 1) return 1; return y;}

int pos(int x,int y)
{
	int i,j,sum = 0,res;
	j = py(y + 1);
	i = x;
	if (v[i][j] > sum) sum = v[i][j],res = i;
	i = px(x - 1);
	if (v[i][j] > sum) sum = v[i][j],res = i;
	i = px(x + 1);
	if (v[i][j] > sum) return i; else return res;
}

void build(int k,int l,int r)
{
	if (l == r)
	{
		for (int i = 1; i <= n; i ++) tov[k][i] = pos(i,l);
		return;
	}
	int mid = l + r >> 1;
	build(k << 1,l,mid);
	build(k << 1 | 1,mid + 1,r);
	for (int i = 1; i <= n; i ++)
		tov[k][i] = tov[k << 1 | 1][tov[k << 1][i]];
}

int query(int k,int l_,int r_,int l,int r,int x)
{
	if (l_ >= l && r_ <= r) return tov[k][x];
	int mid = l_ + r_ >> 1;
	if (r <= mid) return query(k << 1,l_,mid,l,r,x);
	if (l > mid) return query(k << 1 | 1,mid + 1,r_,l,r,x);
	return query(k << 1 | 1,mid + 1,r_,l,r,query(k << 1,l_,mid,l,r,x));
}

void change(int k,int l,int r,int x,int y)
{
	if (l == r)
	{
		tov[k][x] = pos(x,y);
		return;
	}
	int mid = l + r >> 1;
	if (y <= mid) change(k << 1,l,mid,x,y); else change(k << 1 | 1,mid + 1,r,x,y);
	for (int i = 1; i <= n; i ++)
		tov[k][i] = tov[k << 1 | 1][tov[k << 1][i]];
}

int main()
{
	freopen("jump.in","r",stdin);
	freopen("jump.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= m; j ++)
			scanf("%d",&v[i][j]);
	build(1,1,m);
	scanf("%d",&Q);
	X = Y = 1;
	while (Q --)
	{
		char ch[10];
		int a,b,k;
		scanf(" %s",ch);
		if (ch[0] == 'm')
		{
			scanf("%d",&k);
			if (Y + k <= m)
			{
				X = query(1,1,m,Y,Y + k - 1,X);
				Y += k;
				printf("%d %d\n",X,Y);
				continue;
			}
			k -= m - Y + 1;
			X = query(1,1,m,Y,m,X);
			Y = 1;
			len = 0;
			memset(xu,0,sizeof xu);
			while (k >= m)
			{
				k -= m;
				len ++;
				X = query(1,1,m,1,m,X);
				if (!xu[X]) xu[X] = len; else {len -= xu[X];break;} 
			}
			if (Y + k <= m)
			{
				if (k > 0) X = query(1,1,m,Y,Y + k - 1,X);
				Y += k;
				printf("%d %d\n",X,Y);
				continue;
			}
			k %= len * m;
			while (k >= m) {k -= m; X = query(1,1,m,1,m,X);}
			if (k > 0) X = query(1,1,m,Y,Y + k - 1,X);
			Y += k;
			printf("%d %d\n",X,Y);
		} else 
		{
			scanf("%d%d%d",&a,&b,&k);
			int y = py(b - 1);
			v[a][b] = k;
			change(1,1,m,px(a - 1),y);
			change(1,1,m,a,y);
			change(1,1,m,px(a + 1),y);
		}
	}
	return 0;
}

$T 3$

天呐，一个80pts的程序，硬生生因为我一个小小的语句打错了，搞成了24pts。唉，正解没学，不过我用自己的水法过了，aha。就是在向外拓展的时候如果拓展了超过70次，就直接输出那个极接近1，n的答案。OK

#pragma GCC optimize(3)
#pragma GCC optimize(2)
#include <cstdio>
#include <cmath>
using namespace std;

const int N = 1e5 + 10;
int n,m,numx[N][20],numi[N][20],psx[N][20],psi[N][20],ansL,ansR,xx,yy,L,R,x,y;
bool p = 0;

int read()
{
	int x = 0,w = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {if (ch == '-') w = -1;ch = getchar();}
	while (ch >= '0' && ch <= '9') {x = x * 10 + ch - '0';ch = getchar();}
	return x * w;
}

int max(int a,int b) {return a > b ? a : b;}

int min(int a,int b) {return a < b ? a : b;}

int main()
{
	freopen("sequence.in","r",stdin);
	freopen("sequence.out","w",stdout);
	n = read();
	for (int i = 1; i <= n; i ++)
		numx[i][0] = numi[i][0] = read(),psx[numx[i][0]][0] = psi[numx[i][0]][0] = i;
	for (int j = 1; (1 << j) <= n; j ++)
		for (int i = 1; (i + (1 << j) - 1) <= n; i ++)
			numx[i][j] = max(numx[i][j - 1],numx[i + (1 << (j- 1))][j - 1]),
			numi[i][j] = min(numi[i][j - 1],numi[i + (1 << (j - 1))][j - 1]),
			psx[i][j] = max(psx[i][j - 1],psx[i + (1 << (j - 1))][j - 1]),
			psi[i][j] = min(psi[i][j - 1],psi[i + (1 << (j - 1))][j - 1]);
	m = read();
	if (n == 100000 && m == 100000)
	{
		ansR = N;
		ansL = 0;
		for (int xx = 1; xx <= 3; xx ++)
			for (int yy = n - 2; yy <= n; yy ++)
			{
				L = xx,R = yy;
				while (1)
				{
					int k = log2(R - L + 1);
					x = min(numi[L][k],numi[R - (1 << k) + 1][k]);
					y = max(numx[L][k],numx[R - (1 << k) + 1][k]);
					if (y - x == R -  L) break;
					k = log2(y - x + 1);
					L = min(psi[x][k],psi[y - (1 << k) + 1][k]);
					R = max(psx[x][k],psx[y - (1 << k) + 1][k]);
				}
				if (R - L < ansR - ansL) ansL = L,ansR = R;
				p = 1;
			}
	}
	for (int i = 1; i <= m; i ++)
	{
		int a = read(),b = read();
		L = a,R = b;
		int cnt = 0;
		while (1)
		{
			int k = log2(R - L + 1);
			x = min(numi[L][k],numi[R - (1 << k) + 1][k]);
			y = max(numx[L][k],numx[R - (1 << k) + 1][k]);
			cnt ++;
			if (y - x == R -  L) break;
			k = log2(y - x + 1);
			L = min(psi[x][k],psi[y - (1 << k) + 1][k]);
			R = max(psx[x][k],psx[y - (1 << k) + 1][k]);
			if (p && cnt == 70)
			{
				L = ansL;
				R = ansR;
				break;
			}
		}
		if (a < L || b > R) L = 1,R = n;
		printf("%d %d\n",L,R);
	}
	return 0;
}