# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930496 | Regulus | Global Warming (CEOI18_glo) | C++17 | 36 ms | 604 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>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
//#define TEST
const int N = 55;
int a[N], b[N];
vector<int> v;
int main(void)
{ IO
int n, i, ans=0, j, x;
cin >> n >> x;
if (n > 50 || x > 50) assert(0);
for (i=1; i <= n; ++i) cin >> a[i];
for (i=1; i <= n; ++i)
{
for (int j=i; j <= n; ++j)
{
for (int d=-x; d <= x; ++d)
{
v.clear();
for (int k=1; k <= n; ++k)
{
b[k] = a[k];
if (i <= k && k <= j) b[k] += d;
if (v.empty() || b[k] > v.back()) v.pb(b[k]);
else *lower_bound(all(v), b[k]) = b[k];
}
ans = max(ans, (int)SZ(v));
}
}
}
cout << ans << '\n';
return 0;
}
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... |