제출 #344573

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344573		l3nl3	Divide and conquer (IZhO14_divide)	C++14	48 / 100	11 ms	1004 KiB

divide

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>  

#define exit exit(false)

//#define here() cerr << "herewego\n";
#define show(x) cerr << #x << ": " << x << '\n';

#define int long long
//#define double long double

#define all(a) a.begin(), a.end()
#define whole(a, p, q) a+p, a+p+q

#define ioio() ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);

using namespace std;

//using namespace __gnu_pbds;   
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;  

const int sz = 5e3+7;

int n, x[sz], g[sz], d[sz], p[sz], pp[sz], mx, mxx;

signed main () { ioio();
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> g[i] >> d[i];
		p[i] = p[i-1] + d[i];
		pp[i] = pp[i-1] + g[i];
		mx = max (mx, g[i]);
	}
	mxx = mx;
	for (int i = 1; i <= n; i++) {
		int mj = i-1, ans = 0;
		for (int j = n; j >= i+1; j--) {
			if (x[j] - x[i] <= p[j] - p[i-1]) {
				ans += pp[j] - pp[i-1];
				break;
			}
		}
		mxx = max (mxx, ans);
	}
	cout << mxx;
}

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

divide.cpp: In function 'int main()':
divide.cpp:37:7: warning: unused variable 'mj' [-Wunused-variable]
   37 |   int mj = i-1, ans = 0;
      |       ^~

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 0 / 52