oj.uz

Submission #131686

# Submission time Handle Problem Language Result Execution time Memory
131686 2019-07-17T12:52:12 Z apostoldaniel854 Global Warming (CEOI18_glo) C++14
0 / 100
 193 ms 2348 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 3e5, INF = 2e9 + 7;
int nr;
int sol[1 + N], poz[1 + N], scm[1 + N];
int a[1 + N];
inline int get (int n, int orient) {
    int st, dr, p;
    st = 1; dr = nr;
    p = 0;
    while (st <= dr) {
        int mij = (st + dr) / 2;
        if ((sol[mij] > n && orient) || (sol[mij] < n && !orient)) {
            dr = mij - 1;
            p = mij;
        }
        else
            st = mij + 1;
    }
    return p;
}

int main() {
    int n, x;
    cin >> n >> x;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    sol[1] = INF;
    nr = 1;
    for (int i = n; i > 0; i--) {
        if (a[i] < sol[nr]) {
            nr++;
            poz[i] = nr;
            sol[nr] = a[i];
        }
        else {
            int p = get (a[i], 0);
            sol[p] = a[i];
            poz[i] = p;
        }
    }
    sol[1] = -INF;
    nr = 1;
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        int p;
        if (a[i] + x > sol[nr])
            p = nr + 1;
        else
            p = get (a[i] + x, 1);
        //cout << p << "\n";
        ans = max (ans, poz[i] + p - 3);
        if (a[i] > sol[nr]) {
            nr++;
            sol[nr] = a[i];
        }
        else {
            int p = get (a[i], 1);
            sol[p] = a[i];
        }
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 1988 KB Output is correct
2 Correct 193 ms 1936 KB Output is correct
3 Correct 190 ms 2064 KB Output is correct
4 Correct 187 ms 1948 KB Output is correct
5 Incorrect 118 ms 2348 KB Output isn't correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 704 KB Output is correct
2 Correct 47 ms 708 KB Output is correct
3 Correct 47 ms 732 KB Output is correct
4 Incorrect 29 ms 820 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1176 KB Output is correct
2 Correct 89 ms 1104 KB Output is correct
3 Correct 182 ms 1892 KB Output is correct
4 Incorrect 111 ms 2228 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

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