CSPJ2021,T2玄学做法
查看原帖
CSPJ2021,T2玄学做法
461366
封禁用户楼主2021/11/6 18:15

把cin换成scanf就A了,0.8s惊险

#include <bits/stdc++.h>
using namespace std;

int a[8010];
int n, q;

int main() {
	//freopen("sort.in", "r", stdin);
	//freopen("sort.out", "w", stdout);
	scanf("%d%d", &n, &q);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	while (q--) {
		int opr;
		scanf("%d", &opr);
		if (opr == 1) {
			int x, v;
			scanf("%d%d", &x, &v);
			a[x] = v;
		} else {
			int x, ans = 0;
			scanf("%d", &x);
			for (int i = 1; i <= x; i++)
				if (a[i] <= a[x]) ans++;
			for (int i = x + 1; i <= n; i++)
				if (a[i] < a[x]) ans++;
			printf("%d\n", ans);
		}
	}
	return 0;
}
2021/11/6 18:15
加载中...