oj.uz

Submission #468224

# Submission time Handle Problem Language Result Execution time Memory
468224 2021-08-27T09:34:14 Z wdjpng Global Warming (CEOI18_glo) C++17
0 / 100
 132 ms 6892 KB 
#include <bits/stdc++.h>

#define int long long
#define rep(i,n) for(int i = 0; i < n; i++)

using namespace std;

signed main()
{
    int n, x;
    cin >> n >> x;
    vector<int>t(n);
    rep(i,n) cin>>t[i];

    vector<int>c;
    vector<int>right(n);
    for(int i = n-1; i >=0; i--)
    {
        int r = 1e10 - t[i];
        if(!c.size()||r>c[c.size()-1]) c.push_back(r);
        else *(lower_bound(c.begin(), c.end(), r)) = r;
        right[i] = c.size();
    }
    c = vector<int>(n, 1e17);
    
    int maxx = 0;
    rep(i,n)
    {
        maxx=max(maxx, right[i] + (lower_bound(c.begin(), c.end(), t[i] - x) - c.begin()));
        *(lower_bound(c.begin(), c.end(), t[i])) = t[i] - x;
    }
    cout<<maxx<<"\n";
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 25.0

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