# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438827 | 2021-06-28T17:15:33 Z | KhoaHo | Rabbit Carrot (LMIO19_triusis) | C++11 | 3 ms | 332 KB |
///KhoaHo/// #include<bits/stdc++.h> using namespace std; ///define-zone #define task "test" #define vec vector #define priq priority_queue #define pf push_front #define pb push_back #define popb pop_back #define popf pop_front #define SZ(a) a.begin(), a.end() #define SZZ(a, begin, end) a + begin, a + begin + end #define fi first #define se second #define N int(2e5) + 1 ///typedef-zone typedef long long ll; typedef unsigned long long ull; typedef long double ldb; typedef double db; typedef pair<int, int> ii; typedef pair<long long, long long> pll; typedef pair<int, ii> iii; ///code-mau template<class val> inline val gcd(val a, val b){ return (a ? gcd(b%a, a): b);} void init() { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } void fastio() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); } int n, m, a[N]; vec<int> dp; int f[N], g[N], maxx = 0; int tknp(int l, int r, int x) { int mid, ret = 0; while(l <= r) { mid = (l + r) >> 1; if(dp[g[mid]] <= x) { l = mid + 1; ret = mid; } else r = mid - 1; } return ret; } int main() { fastio(); #ifndef ONLINE_JUDGE init(); #endif // ONLINE_JUDGE cin >> n >> m; for(int i = 1; i <= n; i++) { cin >> a[i]; if(a[i] - m*i >= 0) dp.pb(a[i] - m*i); } f[0] = 1; g[1] = 0; for(int i = 1; i < (int)dp.size(); i++) { int k = tknp(1, f[maxx], dp[i]); f[i] = k + 1; g[k + 1] = i; if(f[maxx] < f[i]) maxx = i; } cout << f[maxx]; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 332 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |