Submission #1127472

#	Time	Username	Problem	Language	Result	Execution time	Memory
1127472		O_Elmasry	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	24 ms	5052 KiB

triusis

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 
#endif
#define endl '\n'
#define int int64_t
const long long mod = 1000000007, MaxN = 200005 , INF = 1e18;
void solve(){
  int N, M;
  cin >> N >> M;
  vector<int>a;
  for(int i = 1;i <= N;i++){
    int x;cin >> x;
    if(M * i >= x)a.push_back(M * i - x);
  }
  if(a.empty()){
    return void(cout << N << endl);
  }
  vector<int>dp = {a[0]};
  for(int i = 0;i < a.size();i++){
    if(a[i] >= dp.back()){
      dp.push_back(a[i]);
    }
    else{
      int pos = upper_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
      dp[pos] = a[i];
    }
  }
  cout << N - dp.size() + 1 << endl;
}
signed main()
{
  ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#ifdef LOCAL
  FileRedirect("test");
#endif
  // freopen("file.in","r",stdin);
  // freopen("file.out","w",stdout);
  int tc = 1;
  // cin >> tc;  
  while (tc--)solve();
}

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