oj.uz

Submission #969375

# Submission time Handle Problem Language Result Execution time Memory
969375 2024-04-25T04:50:26 Z vjudge1 Global Warming (CEOI18_glo) C++17
0 / 100
 44 ms 4956 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()};
    }

    int ans = 0;
    
    for(int i = 1; i <= n; ++i) {
        pii t = {lis[i].first - x, i};
        int j = upper_bound(inlis+1+i, inlis+n, t) - inlis;
        int sum = lis[i].second + inlis[j].second;
        ans = max(ans, sum);
    }
    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 2 ms 4440 KB Output is correct
2 Incorrect 2 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Incorrect 2 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Incorrect 2 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4696 KB Output is correct
2 Incorrect 20 ms 4596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Incorrect 2 ms 4444 KB Output isn't correct
3 Halted 0 ms 0 KB -