제출 #445241

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

Main

#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifdef DEBUG
#define debug(args...) _debug(args)
void _debug(const char* format, ...) {
	va_list args;
	va_start(args, format);
	vprintf(format, args);
	va_end(args);
}
#else
#define debug(args...)
#endif

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 200005

int n;
int a[MAXN];
ll psum[MAXN], nsum[MAXN];

int main() {
	scanf("%d", &n);
	REP (i, 1, n + 1) {
		scanf("%d", &a[i]);
		int diff = a[i] - a[i - 1];
		psum[i] = psum[i - 1];
		nsum[i] = nsum[i - 1];
		if (diff >= 0) {
			psum[i] += diff + 1;
		} 
		if (diff <= 0) {
			nsum[i] -= diff - 1;
		}
		debug("%d: %d\n", i, diff);
	}
	ll ans = LINF;
	REP (i, 1, n + 1) {
		ll l = nsum[i], r = psum[n] - psum[i];
		debug("%d: %lld %lld\n", i, l, r);
		mnto(ans, max(l, r));
	}
	printf("%lld\n", ans);
	return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
Main.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

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