제출 #370441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
370441		Kevin_Zhang_TW	Bigger segments (IZhO19_segments)	C++17	27 / 100	23 ms	2540 KiB

segments

#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 = 510, inf = 1e9;

int dp[MAX_N][MAX_N], n;

ll a[MAX_N], pf[MAX_N];

ll sum(int l, int r) { return pf[r] - pf[l-1] ; }

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

	for (int i = 1;i <= n;++i) {
		dp[i][i] = -inf;
		for (int j = i-1;j >= 0;--j) {
			dp[i][j] = j == 0 ? 1 : -inf;

			for (int k = j-1;k >= 0;--k) 
				if (sum(j+1, i) >= sum(k+1, j))
					chmax(dp[i][j], dp[j][k] + 1);
				else break;

			DE(i, j, dp[i][j]);
			chmax(dp[i][j], dp[i][j+1]);
		}
	}

	cout << dp[n][0] << '\n';
}

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

segments.cpp: In function 'int32_t main()':
segments.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
segments.cpp:42:4: note: in expansion of macro 'DE'
   42 |    DE(i, j, dp[i][j]);
      |    ^~

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27