Submission #997692

#	Time	Username	Problem	Language	Result	Execution time	Memory
997692		akamizane	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	26 ms	8392 KiB

triusis

// brute f0rce spammer
 
#include<bits/stdc++.h>
 
using namespace std;
 
typedef pair<long long,long long> pii;

#define int long long 
#define el cout << '\n'
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define debug(f,n) for (int i = 0; i < n; i++){cout << f[i] << " ";} el;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define maxn 4003
#define mod 998244353

template <class T1, class T2>bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;}return false;}
template <class T1, class T2>bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;}return false;}

void solve(){
 int n, k;
 cin >> n >> k;
 vector<int> x(n + 1);
 FOR(i, 1, n) cin >> x[i];
 vector<int> ans;
 FOR(i, 1, n){
  if (k * i - x[i] >= 0){
    ans.pb(k * i - x[i]);
  }
 }
 vector<int> res;
 for (auto k : ans){
  int idx = upper_bound(all(res), k) - res.begin();
  if (idx == res.size()){
    res.pb(k);
  }
   else res[idx] = k;
 } 
 cout << n - res.size();
}

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int q = 1;
  //cin >> q;
  while(q--){
   solve();
   el;
  }
  return 0;
}

Compilation message (stderr)

triusis.cpp: In function 'void solve()':
triusis.cpp:39:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   if (idx == res.size()){
      |       ~~~~^~~~~~~~~~~~~

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