QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #719167 | #7904. Rainbow Subarray | Stelor | TL | 817ms | 6608kb | C++20 | 3.5kb | 2024-11-06 22:59:36 | 2024-11-06 22:59:36 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll inf=1e18;
void solve(){
ll n,k;
cin >> n >> k;
vector<ll> a(n+1);
for(int i=1;i<=n;++i){
std::cin >> a[i];
a[i]-=i;
}
auto check=[&](int len)->bool{
multiset<ll> s2;
multiset<ll,greater<>> s1;
s1.insert(-inf);
s2.insert(inf);
ll sum1=0,sum2=0;
s2.insert(a[1]);
sum2+=a[1];
for(int i=2;i<=len;++i){
if(a[i]>*s1.begin()){
s2.insert(a[i]);
sum2+=a[i];
}else{
s1.insert(a[i]);
sum1+=a[i];
}
while(fabs(s1.size()-s2.size())>1){
if(s1.size()>s2.size()){
ll top=*s1.begin();
sum2+=top;
s2.insert(*s1.begin());
s1.erase(s1.begin());
sum1-=top;
}
if(s1.size()<s2.size()){
ll top=*s2.begin();
sum1+=top;
s1.insert(*s2.begin());
s2.erase(s2.begin());
sum2-=top;
}
}
if(i==len){
if(s1.size()>=s2.size()){
ll mid=*s1.begin();
ll now=(int)s1.size()*mid-sum1;
now+=sum2-(int)s2.size()*mid;
if(now<=k) return true;
}else if(s1.size()<s2.size()){
ll mid=*s2.begin();
ll now=(int)s1.size()*mid-sum1;
now+=sum2-(int)s2.size()*mid;
if(now<=k) return true;
}
}
}
for(int i=len+1;i<=n;++i){
if(a[i-len]>*s1.begin()){
s2.erase(s2.find(a[i-len]));
sum2-=a[i-len];
}else{
s1.erase(s1.find(a[i-len]));
sum1-=a[i-len];
}
if(a[i]>*s1.begin()){
s2.insert(a[i]);
sum2+=a[i];
}else{
s1.insert(a[i]);
sum1+=a[i];
}
while(fabs(s1.size()-s2.size())>1){
if(s1.size()>s2.size()){
ll top=*s1.begin();
sum2+=top;
s2.insert(*s1.begin());
s1.erase(s1.begin());
sum1-=top;
}
if(s1.size()<s2.size()){
ll top=*s2.begin();
sum1+=top;
s1.insert(*s2.begin());
s2.erase(s2.begin());
sum2-=top;
}
}
if(s1.size()>=s2.size()){
ll mid=*s1.begin();
ll now=(int)s1.size()*mid-sum1;
now+=sum2-(int)s2.size()*mid;
if(now<=k) return true;
}else if(s1.size()<s2.size()){
ll mid=*s2.begin();
ll now=(int)s1.size()*mid-sum1;
now+=sum2-(int)s2.size()*mid;
if(now<=k) return true;
}
}
return false;
};
int L=1,R=n;
while(L<R){
int mid=L+R+1>>1;
if(check(mid)) L=mid;
else R=mid-1;
}
cout<<L<<"\n";
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin>>t;
while(t--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3488kb
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: 817ms
memory: 6608kb
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: -100
Time Limit Exceeded
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...