QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#346460#7904. Rainbow Subarrayoscaryang#AC ✓517ms331928kbC++202.9kb2024-03-08 15:43:322024-03-08 15:43:32

Judging History

你现在查看的是最新测评结果

  • [2024-06-09 00:00:26]
  • hack成功,自动添加数据
  • (/hack/652)
  • [2024-03-08 15:43:32]
  • 评测
  • 测评结果:AC
  • 用时:517ms
  • 内存:331928kb
  • [2024-03-08 15:43:32]
  • 提交

answer

#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

#define int long long

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 5e5 + 5;

int n, k, len, ans, a[N], b[N], o[N];

namespace sgt {
	const pii emp = mkp(0, 0);
	int idx, rt[N], lc[N * 20], rc[N * 20];
	pii tre[N * 20];
	pii operator + (pii A, pii B) { return mkp(A.first + B.first, A.second + B.second); } 
	pii operator - (pii A, pii B) { return mkp(A.first - B.first, A.second - B.second); }
	#define mid (l + r >> 1)
	inline int newnode() { ++idx; lc[idx] = rc[idx] = 0; tre[idx] = emp; return idx; }
	inline void ins(int &k, int pr, int l, int r, int p, pii v) {
		k = newnode(); lc[k] = lc[pr], rc[k] = rc[pr]; tre[k] = tre[pr] + v;
		if(l != r) return p <= mid ? ins(lc[k], lc[pr], l, mid, p, v) : ins(rc[k], rc[pr], mid + 1, r, p, v);
	}
	inline int kth(int x, int y, int l, int r, int k) {
		if(l == r) return l; 
		int tot = tre[lc[x]].first - tre[lc[y]].first;
		return tot >= k ? kth(lc[x], lc[y], l, mid, k) : kth(rc[x], rc[y], mid + 1, r, k - tot);
	}
	inline pii ask(int x, int y, int l, int r, int L, int R) {
		if(!x || L > R) return emp;
		if(L <= l && R >= r) return tre[x] - tre[y];
		if(L > mid) return ask(rc[x], rc[y], mid + 1, r, L, R);
		if(R <= mid) return ask(lc[x], lc[y], l, mid, L, R);
		return ask(lc[x], lc[y], l, mid, L, R) + ask(rc[x], rc[y], mid + 1, r, L, R);
	}
}
using namespace sgt;

inline int calc(int l, int r) {
	int k = (r - l + 2) / 2, x = kth(rt[r], rt[l - 1], 1, len, k);
	auto u = ask(rt[r], rt[l - 1], 1, len, 1, x);
	auto v = ask(rt[r], rt[l - 1], 1, len, x + 1, len);
	return u.first * b[x] - u.second + v.second - v.first * b[x];
}

inline int check(int l, int r) {
	if(r > n) return 0;
	return calc(l, r) <= k;
}

inline void testcase() {
	n = read(); k = read(); len = idx = 0; ans = 1;
	rep(i, 1, n) b[++len] = a[i] = read() - i, o[i] = i;
	
	sort(b + 1, b + 1 + len); len = unique(b + 1, b + 1 + len) - b - 1;
	rep(i, 1, n) {
		a[i] = lower_bound(b + 1, b + 1 + len, a[i]) - b;
		ins(rt[i], rt[i - 1], 1, len, a[i], mkp(1, b[a[i]]));
	}
	
	random_shuffle(o + 1, o + 1 + n);
	for(int i = 1, u = o[1], l, r; i <= n; i++, u = o[i]) {
		if(!check(u, u + ans - 1)) continue;
		l = 1; r = n - u + 1;
		while(l <= r) 
			if(check(u, u + mid - 1)) l = mid + 1;
			else r = mid - 1;
		ans = max(ans, r);
	}
	
	printf("%lld\n", ans);
}

signed main() {
	srand(time(0));
	int t = read(); while(t--) testcase();
	return 0;
}




























这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 14188kb

input:

5
7 5
7 2 5 5 4 11 7
6 0
100 3 4 5 99 100
5 6
1 1 1 1 1
5 50
100 200 300 400 500
1 100
3

output:

4
3
5
1
1

result:

ok 5 lines

Test #2:

score: 0
Accepted
time: 219ms
memory: 77444kb

input:

11102
2 167959139
336470888 134074578
5 642802746
273386884 79721198 396628655 3722503 471207868
6 202647942
268792718 46761498 443917727 16843338 125908043 191952768
2 717268783
150414369 193319712
6 519096230
356168102 262263554 174936674 407246545 274667941 279198849
9 527268921
421436316 3613460...

output:

1
4
3
2
6
5
7
2
4
1
4
1
1
3
2
2
7
8
7
7
1
7
6
2
4
3
1
6
7
7
3
4
3
9
3
8
6
6
3
1
6
3
1
2
4
6
4
6
4
1
4
7
1
6
3
5
6
6
1
7
5
3
1
6
4
5
3
2
2
6
2
3
10
1
4
3
2
4
5
1
7
5
5
5
8
5
3
6
3
5
5
8
5
4
5
2
1
5
2
3
3
4
8
1
3
1
2
2
8
3
1
6
8
1
8
4
5
6
6
8
4
8
3
2
8
4
5
6
2
6
2
4
1
5
4
5
3
2
4
1
2
1
4
5
8
3
7
3
3
3...

result:

ok 11102 lines

Test #3:

score: 0
Accepted
time: 502ms
memory: 331808kb

input:

1
500000 17244641009859
54748096 75475634 204928248 276927808 84875072 103158867 27937890 322595515 186026685 45468307 69240390 139887597 188586447 373764525 121365644 310156469 185188306 60350786 211308832 384695957 370562147 208427221 35937909 267590963 126478310 275357775 55361535 335993561 36696...

output:

172998

result:

ok single line: '172998'

Test #4:

score: 0
Accepted
time: 517ms
memory: 331884kb

input:

1
500000 43483524125987
923264237 374288891 535590429 751244358 124321145 232930851 266089174 543529670 773363571 319728747 580543238 582720391 468188689 490702144 598813561 138628383 284660056 733781508 155605777 931759705 245485733 723534730 257812292 794937524 596788519 188451996 981010588 144836...

output:

174260

result:

ok single line: '174260'

Test #5:

score: 0
Accepted
time: 83ms
memory: 331928kb

input:

1
499999 62499749999
496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081 496813081...

output:

499998

result:

ok single line: '499998'

Extra Test:

score: 0
Extra Test Passed