제출 #448617

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448617		Neos	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	37 ms	5316 KiB

triusis

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<ld> vld;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;
 
#define task "test"
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define forw(i,l,r) for( ll i = (l) ; i < (r) ; i++ )
#define forb(i,r,l) for( ll i = (r) ; i >= (l) ; i-- )
#define sz(x) (int)x.size()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define cntbit(x) __builtin_popcount(x)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
 
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
 
const int N = 2e5+7;
const ll inf = 1e18;
 
int n, m, h[N];
vi lis, List;
 
void solve() {
  cin >> n >> m;
  forw(i, 1, n + 1) cin >> h[i];
 
  int ans = 0;
  forw(i, 2, n + 2) 
    if (m * (i - 1) >= h[i - 1]) {
      List.pb(m * (i - 1) - h[i - 1]);
    }
 
  for (auto it: List) {
    auto p = upper_bound(all(lis), it);
    if (p == lis.end()) lis.pb(it);
    else lis[(p - lis.begin())] = it;
  }
  cout << n - sz(lis) << endl;
}
 
int main() {
  fastIO;
  /*#ifndef ONLINE_JUDGE
  freopen(task".inp", "r", stdin);
  freopen(task".out", "w", stdout);
  #endif*/
 
  int tc = 1;
  // cin >> tc;
  while (tc--) {
    solve();
  }
}

컴파일 시 표준 에러 (stderr) 메시지

triusis.cpp: In function 'void solve()':
triusis.cpp:49:7: warning: unused variable 'ans' [-Wunused-variable]
   49 |   int ans = 0;
      |       ^~~

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