제출 #716662

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716662		Lextyle	Rabbit Carrot (LMIO19_triusis)	C++17	100 / 100	36 ms	3148 KiB

triusis

#include <bits/stdc++.h>    
#pragma warning(disable : 4996)                                                 
#pragma warning(disable : 6031)                                                 
#define USACO freopen("exercise.in", "r", stdin); freopen("exercise.out", "w+", stdout)
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)  
#define ll long long 
using namespace std;

ll binpow(ll a, ll x, ll m) {
    ll ans = 1, md = a % m;
    while (x != 0) {
        if (x % 2 == 1) ans = (ans * md) % m;
        md = (md * md) % m;
        x >>= 1;
    }
    return ans;
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
    return a * b / gcd(a, b);
}
/*

*/
int h[200000], d[200001];

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> h[n - 1 - i];
        h[n - 1 - i] -= (i + 1) * m;
    }
    d[0] = INT32_MIN;
    for (int i = 1; i <= n; i++) d[i] = INT32_MAX;
    for (int i = 0; i < n; i++) {
        if (h[i] > 0) continue;
        int l = 0, r = n;
        while (l < r) {
            int mid = l + (r - l + 1) / 2;
            if (d[mid] <= h[i]) l = mid;
            else r = mid - 1;
        }
        if (l != n) d[l + 1] = min(d[l + 1], h[i]);
    }
    for (int i = n; i >= 0; i--) {
        if (d[i] != INT32_MAX) {
            cout << n - i << "\n";
            return;
        }
    }
}

int main() {
    //USACO;                           
    fastIO;
    solve();
}

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

triusis.cpp:2: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    2 | #pragma warning(disable : 4996)
      | 
triusis.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    3 | #pragma warning(disable : 6031)
      |

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