# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259878 | peuch | Global Warming (CEOI18_glo) | C++17 | 2090 ms | 1912 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
const int INF = 2e9 + 7;
int n, x;
int v[MAXN];
int dp[MAXN];
int ans;
void bt(int cur, int sum);
int main(){
scanf("%d %d", &n, &x);
for(int i = 1; i <= n; i++)
scanf("%d", &v[i]);
for(int i = n; i > 0; i--){
for(int j = 1; j <= n; j++)
dp[j] = INF;
for(int j = 1; j <= n; j++){
int k = lower_bound(dp, dp + 1 + n, v[j]) - dp;
dp[k] = v[j];
ans = max(ans, k);
}
v[i] += x;
}
printf("%d\n", ans);
}
void bt(int cur, int sum){
for(int i = 1; i <= n; i++)
dp[i] = INF;
for(int i = 1; i <= n; i++){
int k = lower_bound(dp, dp + 1 + n, v[i]) - dp;
dp[k] = v[i];
ans = max(ans, k);
}
if(cur == n) return;
v[cur + 1] += sum;
bt(cur + 1, sum);
v[cur + 1] -= sum;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |