제출 #525018

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525018		asliddinaif	Bigger segments (IZhO19_segments)	C++14	13 / 100	2 ms	4252 KiB

segments

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
const int maxx = 1e6;
int a[maxx], dp[maxx], b[maxx];
vector <int> pr(maxx);
void S()
{
	int n;
	cin >> n;
	fpp(i,1,n)
		cin >> a[i], pr[i] = pr[i-1] + a[i], b[i] = 1, dp[i] = 1e9;
	fpp(i,1,n){
		b[i] = max(b[i], b[i-1]);
		dp[i] = min(dp[i-1] + a[i], dp[i]);
		auto x = lower_bound(pr.begin()+1, pr.begin()+n+1, dp[i]+pr[i]) - pr.begin();
		b[x] = b[i]+1;
		dp[x] = pr[x] - pr[i];
	//	cout << dp[i] << " " << b[i] << " " << x << "\n";
	}
	cout << b[n];
}
int main()
{
	IOS;
	S();
}

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

segments.cpp: In function 'void S()':
segments.cpp:7:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
      |                            ^
segments.cpp:17:2: note: in expansion of macro 'fpp'
   17 |  fpp(i,1,n)
      |  ^~~
segments.cpp:7:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
      |                            ^
segments.cpp:19:2: note: in expansion of macro 'fpp'
   19 |  fpp(i,1,n){
      |  ^~~

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