oj.uz

Submission #328163

# Submission time Handle Problem Language Result Execution time Memory
328163 2020-11-15T13:41:48 Z Karen124 Global Warming (CEOI18_glo) C++14
17 / 100
 110 ms 5356 KB 
#include <bits/stdc++.h>
     
using namespace std;
     
#define ll long long int 
#define F first
#define S second
#define pb push_back
#define md ((b + e) >> 1)
#define lc (ind << 1)
#define rc (lc | 1)

const ll N = 2e5 + 10;
const ll LOG = 50;
const ll MOD = 1e9 + 7;
const ll INF = 1e9 + 10;
int n, add, a[N], b[N], ans;
pair <int, int> mx[N];
int main() {
    cin >> n >> add;
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    int len = 0;
    for (int i = 0; i < n; i++){
        int p = lower_bound(b, b + len, a[i]) - b; 
        b[p] = a[i];
        len = max(len, p + 1);
        if (i == 0) mx[i] = {p + 1, -a[0]};
        else mx[i] = max(mx[i - 1], {p + 1, -a[i]}); 
    }
    ans = len;
    fill(b, b + n + 1, 0);
    len = 0;
    for (int i = n - 1; i >= 0; i--){
        int p = lower_bound(b, b + len, -(a[i] + add)) - b;
        b[p] = -(a[i] + add);
        len = max(len, p + 1);
        if (i && a[i - 1] < a[i] + add){
            ans = max(ans, mx[i - 1].F + p + 1);
        }
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 1672 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 64 ms 2916 KB Output is correct
2 Correct 55 ms 2924 KB Output is correct
3 Correct 108 ms 5356 KB Output is correct
4 Correct 70 ms 4588 KB Output is correct
5 Correct 35 ms 2540 KB Output is correct
6 Correct 77 ms 4460 KB Output is correct
7 Correct 87 ms 5228 KB Output is correct
8 Correct 51 ms 2924 KB Output is correct

Subtask #7
0 / 25.0

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