제출 #492260

#제출 시각아이디문제언어결과실행 시간메모리
492260leu_nautRabbit Carrot (LMIO19_triusis)C++11
100 / 100
30 ms7488 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define FOR(i,a,b) for (int i = a; i <= b; ++i)
#define FORd(i,a,b) for (int i = a; i >= b; --i)
#define f first
#define s second
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0);
#define ii pair <int,int>
#define pii pair <ll,ll>
#define all(x) x.begin(), x.end()

const int N = 2e5;
const ll MOD = 1e9 + 7;
const ll base = 31;
const ll oo = 1e18;

ll a[N + 5], b[N + 5];

int main()
{
    /*freopen("pcb.in", "r", stdin);
    freopen("pcb.out", "w", stdout); */
    FastIO
    ll n,m;
    cin >> n >> m;
    FOR(i,1,n) {
        cin >> a[i];
        b[i] = -a[i] + m * i;
    }
    vector <ll> lis;
    FOR(i,1,n)
    {
        if (b[i] < 0) continue;
        int pos = upper_bound(lis.begin(), lis.end(), b[i]) - lis.begin();
        if (pos == lis.size()) lis.push_back(b[i]);
        else lis[pos] = b[i];
    }
    cout << n - lis.size();
}

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

triusis.cpp: In function 'int main()':
triusis.cpp:39:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         if (pos == lis.size()) lis.push_back(b[i]);
      |             ~~~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...