제출 #882292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
882292		proteam23	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	24 ms	6160 KiB

triusis

#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <ctype.h>
#include <math.h>
#define int long long
#define ii pair<int,int>
#define fi first
#define se second
#define getbit(x,y) (((x)>>(y))&1)
#define turnon(x,y) ((x)|(1<<y))
#define turnof(x,y) ((x)^(1<<y))
#define oo 1000000000000000000
#define pb push_back
#define all(x) x.begin(),x.end()
#define con(mask) mask=(mask-1)&mask
#define Unique(val) val.erase(unique(val.begin(),val.end()),val.end())

const int mod=1e9+7;
using namespace std;

int n, m, res;
int h[200005];

signed main()
{

    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    cin >> n >> m;

    for(int i = 1; i <= n; i++) {
        cin >> h[i];
    }

    vector<int>f;
    f.pb(-oo);

    for(int i = 1; i <= n; i++) {
        if(h[i] <= i * m) {
            int tmp = i * m - h[i];

            int pos = upper_bound(all(f), tmp) - f.begin();

            if(pos == f.size()) f.pb(tmp);
            else f[pos] = tmp;

            res = max(res, pos);
        }
    }

    cout << n - res;
}
//      ProTeam
//(¯`·.·´¯) (¯`·.·´¯)
//`·.¸(¯`·.·´¯)¸ .·
//×°× ` ·.¸.·´ ×°×

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

triusis.cpp: In function 'int main()':
triusis.cpp:55:20: 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]
   55 |             if(pos == f.size()) f.pb(tmp);
      |                ~~~~^~~~~~~~~~~

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