제출 #648447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
648447		ghostwriter	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	35 ms	6176 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const ll oo = 1e18;
const int N = 2e5 + 5;
int n, a[N];
ll d[N], d1[N], rs = oo;
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, n) d[i] = d[i - 1] + max(0, a[i - 1] + 1 - a[i]);
    FOS(i, n, 1) d1[i] = d1[i + 1] + max(0, a[i + 1] + 1 - a[i]);
    FOR(i, 1, n) rs = min(rs, max(d[i], d1[i]));
    cout << rs;
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
Main.cpp:60:5: note: in expansion of macro 'FOR'
   60 |     FOR(i, 1, n) cin >> a[i];
      |     ^~~
Main.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
Main.cpp:61:5: note: in expansion of macro 'FOR'
   61 |     FOR(i, 1, n) d[i] = d[i - 1] + max(0, a[i - 1] + 1 - a[i]);
      |     ^~~
Main.cpp:33:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   33 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
Main.cpp:62:5: note: in expansion of macro 'FOS'
   62 |     FOS(i, n, 1) d1[i] = d1[i + 1] + max(0, a[i + 1] + 1 - a[i]);
      |     ^~~
Main.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
Main.cpp:63:5: note: in expansion of macro 'FOR'
   63 |     FOR(i, 1, n) rs = min(rs, max(d[i], d1[i]));
      |     ^~~

• Subtask 1: 40 / 40
• Subtask 2: 60 / 60