제출 #589210

#제출 시각아이디문제언어결과실행 시간메모리
589210MazaalaiRabbit Carrot (LMIO19_triusis)C++17
100 / 100
32 ms4016 KiB
#include <bits/stdc++.h> // #pragma GCC optimize("O3, unroll-loops") // #pragma GCC target("avx2") // #define int long long using namespace std; #define _upgrade \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define LINE "---------------------\n" #define ALL(A) A.begin(), A.end() #define LLA(A) A.rbegin(), A.rend() #define Q queue #define ff first #define ss second #define pb push_back #define mp make_pair #define lb lower_bound #define ub upper_bound #define sz(x) (int)x.size() using ll = long long; using db = double; using ld = long double; using uint = unsigned; // PQ going up <int, VI, greater<int> > using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>; using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>; using VLL = vector<ll>; using VVLL = vector<VLL>; using PII = pair<int, int>; using VPI = vector<PII>; using VVPI = vector<VPI>; using PLL = pair<ll, ll>; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void eraseDups(VI& a) { a.erase(unique(a.begin(), a.end()), a.end()); } int strToInt(string&a) { stringstream x(a); int b; x >> b; return b; } int bitCnt(int a) { bitset <64> b(a); return b.count(); } int bitCnt(string a) { bitset <64> b(a); return b.count(); } int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } /* | _ | __ _ | | | | \| | ___ ___ | |_ | | |\ | |/ _ \/ __/| __| | | | \ | __/\__ \| |_ | |_| \_|\___ /___/ \__| | _ _ _ | (_) | | | | | _ __ _ __ ___ __ _ _ __ __ _ _ __ ___ _ __ ___ _ ___ ___| |_| |_ | | '_ \| '__/ _ \ / _` | '__/ _` | '_ ` _ \| '_ ` _ \| / __/ __| __| __| | | |_) | | | (_) | (_| | | | (_| | | | | | | | | | | | \__ \__ \ |_| |_ | | .__/|_| \___/ \__, |_| \__,_|_| |_| |_|_| |_| |_|_|___/___/\__|\__| | | | __/ | | |_| |___/ _ | _ (_) | _ __ ___ __ _ ____ __ _ __ _| | __ _ _ | | '_ ` _ \ / _` |_ / _` |/ _` | |/ _` | | | | | | | | | (_| / / (_| | (_| | | (_| | | | |_| |_| |_|\__,_|____\__,_|\__,_|_|\__,_|_| */ const db PI = acos(-1.0); //M_PI; const ll INFF = 4e18; const int INF = 1.07e9; const int MOD = 1e9 + 7; const int MOD1 = 998244353; //7*19*2^23 +1; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, 1, 0, -1}; const int N = 5e3 + 5; const int M = 2e5 + 5; int dp[N]; ll n, m, k, q; string s; void go () { cin >> n >> m; vector <ll> vals; for (int i = 1; i <= n; i++) { ll num; cin >> num; num = i * m - num; if (num < 0) continue; if (vals.empty() || vals.back() <= num) vals.pb(num+1); auto it = ub(ALL(vals), num); *it = num; // cout << num << " \n"[i==n]; } cout << n - vals.size() << '\n'; } signed main () { #ifndef ONLINE_JUDGE // freopen("0.in", "r", stdin); // freopen("0.out", "w", stdout); #endif _upgrade int T = 1; while(T--) go(); return (0-0); //<3 } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...