This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
const int INF = 1e18;
int N, M, lis;
int A[200010], dp[200010];
signed main() {
fast;
cin >> N >> M;
for (int i = 1; i <= N; ++i) {
cin >> A[i];
A[i] -= (i * M);
}
A[0] = 0;
for (int i = 0; i <= 200010; ++i) dp[i] = INF;
for (int i = N; i >= 0; --i) {
int p = upper_bound(dp + 1, dp + N + 2, A[i]) - dp;
dp[p] = A[i];
// debug(A[i], p);
lis = p;
}
cout << N - lis + 1;
return 0;
}
Compilation message (stderr)
triusis.cpp: In function 'int main()':
triusis.cpp:29:45: warning: iteration 200010 invokes undefined behavior [-Waggressive-loop-optimizations]
29 | for (int i = 0; i <= 200010; ++i) dp[i] = INF;
| ~~~~~~^~~~~
triusis.cpp:29:23: note: within this loop
29 | for (int i = 0; i <= 200010; ++i) dp[i] = INF;
| ~~^~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |