제출 #203531

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
203531		Just_Solve_The_Problem	Bigger segments (IZhO19_segments)	C++11	0 / 100	5 ms	376 KiB

segments

#include <bits/stdc++.h>
 
#define ll long long
 
using namespace std;          
 
const int N = (int)5e5 + 7;
 
int n;
int a[N], dp[N], ind[N];
ll pref[N];
 
main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		pref[i] = pref[i - 1] + a[i];
	}
	int cur = 1;
	for (int i = 1; i <= n; i++) {
		ind[i] = max(ind[i], ind[i - 1]);
		dp[i] = dp[ind[i]] + 1;
		ll X = pref[i] * 2 - pref[ind[i]];
		cur = max(cur, i + 1);
		while (cur <= n && X > pref[cur]) cur++;
		ind[cur] = i;
	}
	cout << dp[n];
}

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

segments.cpp:13:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
segments.cpp: In function 'int main()':
segments.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
segments.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

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