QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#706346#7904. Rainbow Subarrayq1w2e3r4#WA 287ms30360kbC++144.1kb2024-11-03 10:44:192024-11-03 10:44:19

Judging History

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

  • [2024-11-03 10:44:19]
  • 评测
  • 测评结果：WA
  • 用时：287ms
  • 内存：30360kb
查看
  • [2024-11-03 10:44:19]
  • 提交

answer

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

const int MAXN = 1e6 + 10;
int T,N,K;

map<int,int> mp;
int a[MAXN];

int mid = 0;
int lsum = 0, rsum = 0;
int lcnt = 0, rcnt = 0, midcnt = 0;

int add(int x){
    if(midcnt == 0 && lcnt == 0 && rcnt == 0){
        mid = x;
        mp[mid] = 1;
        midcnt = 1;
        return 0;
    }
    mp[x]++;
    if(x < mid){
        lsum += x;
        lcnt++;
        if(lcnt > midcnt + rcnt){
            auto it = prev(mp.lower_bound(mid));
            int y = it->first, ycnt = it->second;
            lsum -= y * ycnt;
            lcnt -= ycnt;
            rsum += mid * midcnt;
            rcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        return lcnt * mid - lsum + rsum - rcnt * mid;
    }
    else if(x > mid){
        rsum += x;
        rcnt++;
        if(rcnt > midcnt + lcnt){
            auto it = mp.lower_bound(mid + 1);
            int y = it->first, ycnt = it->second;
            rsum -= y * ycnt;
            rcnt -= ycnt;
            lsum += mid * midcnt;
            lcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        return lcnt * mid - lsum + rsum - rcnt * mid;
    }
    else if(x == mid){
        midcnt++;
        if(lcnt > midcnt + rcnt){
            auto it = prev(mp.lower_bound(mid));
            int y = it->first, ycnt = it->second;
            lsum -= y * ycnt;
            lcnt -= ycnt;
            rsum += mid * midcnt;
            rcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        if(rcnt > midcnt + lcnt){
            auto it = mp.lower_bound(mid + 1);
            int y = it->first, ycnt = it->second;
            rsum -= y * ycnt;
            rcnt -= ycnt;
            lsum += mid * midcnt;
            lcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        return lcnt * mid - lsum + rsum - rcnt * mid;
    }
    return 1e18;
}

int del(int x){
    mp[x]--;
    if(mp[x] == 0) mp.erase(x);
    int flag = 0;
    if(x < mid){
        lsum -= x;
        lcnt--;
        if(rcnt > midcnt + lcnt){
            auto it = mp.lower_bound(mid + 1);
            int y = it->first, ycnt = it->second;
            rsum -= y * ycnt;
            rcnt -= ycnt;
            lsum += mid * midcnt;
            lcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        return lcnt * mid - lsum + rsum - rcnt * mid;
    }
    else if(x > mid){
        rsum -= x;
        rcnt--;
        if(lcnt > midcnt + rcnt){
            auto it = prev(mp.lower_bound(mid));
            int y = it->first, ycnt = it->second;
            lsum -= y * ycnt;
            lcnt -= ycnt;
            rsum += mid * midcnt;
            rcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        return lcnt * mid - lsum + rsum - rcnt * mid;
    }
    else if(x == mid){
        midcnt--;
        if(lcnt > midcnt + rcnt){
            auto it = prev(mp.lower_bound(mid));
            int y = it->first, ycnt = it->second;
            lsum -= y * ycnt;
            lcnt -= ycnt;
            rsum += mid * midcnt;
            rcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        if(rcnt > midcnt + lcnt){
            auto it = mp.lower_bound(mid + 1);
            int y = it->first, ycnt = it->second;
            rsum -= y * ycnt;
            rcnt -= ycnt;
            lsum += mid * midcnt;
            lcnt += midcnt;
            mid = y;
            midcnt = ycnt;
        }
        return lcnt * mid - lsum + rsum - rcnt * mid;
    }
    return 1e18;
}

void prepare(){
    cin >> N >> K;
    for(int i = 1; i <= N; i++){
        cin >> a[i];
        a[i] -= i;
    }
    int r = 0;
    int ans = 0;
    for(int i = 1; i <= N; i++){
        while(r < N){
            if(add(a[r+1]) > K){
                del(a[r+1]);
                break;
            }
            r++;
        }
        ans = max(ans, r - i + 1);
        del(a[i]);
    }
    cout << ans << "\n";
}

int main(){
    cin >> T;
    while(T--){
        prepare();
    }
}
源文件, 语言: C++14

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3740kb

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: 287ms
memory: 5556kb

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
Wrong Answer
time: 173ms
memory: 30360kb

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:

500000

result:

wrong answer 1st lines differ - expected: '172998', found: '500000'
English 繁體中文 简体中文

伺服器時間: 2024-12-02 16:42:00 | 開源專案