Submission #1136305

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136305		pan	Robot (JOI21_ho_t4)	C++20	0 / 100	4 ms	1860 KiB

Main

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int main()
{
	ll n;
	cin >> n;
	vector<ll> a(n), b(n), aa(n), bb(n), ps(n), ss(n), dp1(n), dp2(n);
	for (ll i=0; i<n; ++i) {cin >> a[i]; b[i] = a[i];}
	aa[0] = a[0]; bb[n-1] = b[n-1];
	for (ll i=1; i<n; ++i) aa[i] = max(a[i], a[i-1]+1);
	for (ll i=n-2; i>=0; --i) bb[i] = max(b[i], b[i+1]+1);
	for (ll i=0; i<n; ++i) ps[i] = aa[i]-a[i], ss[i] = bb[i] - b[i];
	dp1[0] = ps[0];
	for (ll i=1; i<n; ++i) dp1[i] = dp1[i-1] + ps[i];
	dp2[n-1] = ss[n-1];
	for (ll i=n-2; i>=0; --i) dp2[i] = dp2[i+1] + ss[i];
	ll ans = dp2[0];
	for (ll i=1; i<n; ++i) {ans = min(ans, max(dp1[i-1], dp2[i])); }
	cout << ans << endl;
	return 0;
}

• Subtask 1: 0 / 34
• Subtask 2: 0 / 24
• Subtask 3: 0 / 42