Submission #1269039

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269039		sealsarecool	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	2 ms	328 KiB

triusis

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

int main() {
  int N,M;
  cin>>N>>M;
  long long pillars[N];
  memset(pillars,0,sizeof(pillars));
  int ans = 0;
  for(int i = 0;i<N;i++){
    
    long long x;
    cin>>x;
    pillars[i] = x-M*(i);
  }
  vector<long long>dp(N+1,-1e17);
  dp[0] = 1e17;
  for (int i = 0; i < N; i++) {
      int l = upper_bound(dp.begin(), dp.end(), pillars[i],greater<long long>()) - dp.begin();
      if(l==1&&pillars[i]>1LL*M*(i+1)){
        continue;
      }
      if (dp[l-1] >= pillars[i] && pillars[i] >= dp[l])
        dp[l] = pillars[i];
  }
    for (int l = 0; l < N; l++) {
        if (dp[l] > -1e17)
            ans = l;
    }
    cout<<N-ans<<endl;
  
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37