QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#578965 | #7904. Rainbow Subarray | Master640 | TL | 1418ms | 6816kb | C++14 | 2.3kb | 2024-09-20 23:55:10 | 2024-09-20 23:55:10 |
Judging History
answer
//
// Created by 35263 on 2024/9/20.
//先减去index,然后再对顶堆求中位数,最后check所有值
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 500005;
const ll inf = 1e18+7;
ll n,k,a[maxn];
namespace Set{
multiset<ll>less,great;
ll value_less,value_great;
void init(){
less.clear();great.clear();
less.insert(-inf);great.insert(inf);
value_less=0;value_great=0;
}
void adjust(){
if(less.size()>great.size()+1){
auto it=prev(less.end());
value_great+=*it;value_less-=*it;
great.insert(*it);less.erase(it);
}
if(less.size()<great.size()){
auto it=great.begin();
value_less+=*it;value_great-=*it;
less.insert(*it);great.erase(it);
}
}
void insert(ll _val){
if(_val<=*great.begin())less.insert(_val),value_less+=_val;
else great.insert(_val),value_great+=_val;
adjust();
}
void del(ll _val){
auto it=less.lower_bound(_val);
if(it!=less.end()){
less.erase(it);
value_less-=_val;
}
else{
it=great.lower_bound(_val);
great.erase(it);
value_great-=_val;
}
adjust();
}
ll get_middle(){
return *less.rbegin();
}
ll calc(ll x){
ll tmp_less=x*less.size()-value_less,tmp_great=value_great-x*great.size();
return tmp_less+tmp_great;
}
}
ll check(ll x){
Set::init();
for(ll i=1;i<=x;i++){
Set::insert(a[i]);
}
ll tmp=Set::calc(Set::get_middle());
for(ll i=x+1;i<=n;i++){
Set::del(a[i-x]);
Set::insert(a[i]);
tmp=min(tmp,Set::calc(Set::get_middle()));
}
return tmp<=k;
}
void init(){
cin>>n>>k;
for(ll i=1;i<=n;i++)cin>>a[i],a[i]-=i;
ll l=1,r=n,ans=0;
while(l<=r){
ll mid=(l+r)>>1;
if(check(mid)){
ans=mid;l=mid+1;
}
else{
r=mid-1;
}
}
cout<<ans<<endl;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll t;
cin>>t;
while(t--){
init();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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: 1418ms
memory: 6816kb
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...