제출 #372515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372515		Kevin_Zhang_TW	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	34 ms	5868 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 300010;

int n, a[MAX_N];
ll b[MAX_N], pf[MAX_N], suf[MAX_N];

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n;
	for (int i = 1;i <= n;++i)
		cin >> a[i];

	for (int i = 1;i <= n + 1;++i)
		b[i] = a[i] - a[i-1];

	debug(b+1, b+2+n);

	for (int i = 1;i <= n + 1;++i)
		pf[i] = pf[i-1] - min(0ll, b[i] - 1);

	for (int i = n + 1;i >= 1;--i)
		suf[i] = suf[i+1] + max(0ll, b[i] + 1);

	ll res = LLONG_MAX;

	debug(pf+1, pf+n+2);
	debug(suf+1, suf+n+2);
	for (int i = 1;i <= n;++i)
		chmin(res, max(pf[i], suf[i+1]));

	cout << res << '\n';

}

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

Main.cpp: In function 'int32_t main()':
Main.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Main.cpp:32:2: note: in expansion of macro 'debug'
   32 |  debug(b+1, b+2+n);
      |  ^~~~~
Main.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Main.cpp:42:2: note: in expansion of macro 'debug'
   42 |  debug(pf+1, pf+n+2);
      |  ^~~~~
Main.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
Main.cpp:43:2: note: in expansion of macro 'debug'
   43 |  debug(suf+1, suf+n+2);
      |  ^~~~~

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