oj.uz

Submission #969382

# Submission time Handle Problem Language Result Execution time Memory
969382 2024-04-25T05:15:30 Z vjudge1 Global Warming (CEOI18_glo) C++17
17 / 100
 38 ms 7124 KB 
#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>

const int mxN = 2e5+5;
int n, x, arr[mxN];
pii lis[mxN], inlis[mxN];
int last[mxN];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> x;
    vector<int> temp;
    for(int i = 1; i <= n; ++i) {
        cin >> arr[i];
        auto itr = lower_bound(temp.begin(), temp.end(), arr[i]);
        if(itr == temp.end())
            temp.emplace_back(arr[i]);
        else
            *itr = arr[i];
        lis[i] = {temp[temp.size()-1], temp.size()};
    }
    temp.clear();
    for(int i = n; i >= 1; --i) {
        auto itr = lower_bound(temp.begin(), temp.end(), -arr[i]);
        if(itr == temp.end())
            temp.emplace_back(-arr[i]);
        else 
            *itr = -arr[i];

        inlis[i] = {-temp[temp.size()-1], temp.size()};
        // cout << inlis[i].first << ' ' << inlis[i].second << '\n';
    }

    int ans = 0;
    for(int i = 1; i < n; ++i) {
        pii t = {lis[i].first - x + 1, 0};
        int j = lower_bound(inlis+i+1, inlis+n, t) - inlis;
        int sum = lis[i].second + inlis[j].second;
        // ans = max(ans, sum);
        if(sum > ans) {
            ans = sum;
            // cout << i << ' ' << lis[i].second << '\n';
            // cout << j << ' ' << inlis[j].second << "---\n";
        }
    }
    cout << ans;

}

/*
8 7
7 3 5 12 -2 7 3 4
*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4456 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4596 KB Output is correct
8 Incorrect 1 ms 4444 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4456 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4596 KB Output is correct
8 Incorrect 1 ms 4444 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4456 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4596 KB Output is correct
8 Incorrect 1 ms 4444 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 6748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 4952 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5536 KB Output is correct
2 Correct 18 ms 5468 KB Output is correct
3 Correct 38 ms 6736 KB Output is correct
4 Correct 21 ms 6620 KB Output is correct
5 Correct 11 ms 5344 KB Output is correct
6 Correct 19 ms 6588 KB Output is correct
7 Correct 22 ms 7124 KB Output is correct
8 Correct 17 ms 5572 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4456 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4596 KB Output is correct
8 Incorrect 1 ms 4444 KB Output isn't correct
9 Halted 0 ms 0 KB -