oj.uz

Submission #969720

# Submission time Handle Problem Language Result Execution time Memory
969720 2024-04-25T13:44:02 Z vjudge1 Global Warming (CEOI18_glo) C++17
0 / 100
 44 ms 4808 KB 
/*
 * With a little appreciation, in a mostly hollow tone, she says, "Delightful." As if the world has any meaning.
 * TASK : Global Warming
 * AUTHOR : Marszpace
*/

#include<bits/stdc++.h>
using namespace std;
#define int long long

int32_t main(){
  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int n,x;
  cin >> n >> x;
  vector<int> arr(n);
  for(int i=0;i<n;i++){
    cin >> arr[i];
  }

  vector<int> lis,len,tail;
  for(int i=0;i<n;i++){
    int idx;
    if(lis.empty()||lis.back()<arr[i]){
      idx=lis.size();
      lis.push_back(arr[i]);
    }
    else{
      idx=lower_bound(lis.begin(),lis.end(),arr[i])-lis.begin();
      lis[idx]=arr[i];
    }
    tail.push_back(idx+1);
    arr[i]=-1*arr[i];
  }

  int res=lis.size();
  lis.clear();
  for(int i=n-1;i>=1;i--){
    int first=lower_bound(lis.begin(),lis.end(),arr[i]+x)-lis.begin();
    res=max(res,first+tail[i-1]);
    if(lis.empty()||lis.back()<arr[i]){
      lis.push_back(arr[i]);
    }
    else{
      int idx=lower_bound(lis.begin(),lis.end(),arr[i])-lis.begin();
      lis[idx]=arr[i];
    }
  }
  cout << res;
  return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 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 4056 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 1504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2268 KB Output is correct
2 Correct 19 ms 2268 KB Output is correct
3 Correct 39 ms 4200 KB Output is correct
4 Incorrect 19 ms 4808 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

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