제출 #997826

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
997826		daffuwu	Bigger segments (IZhO19_segments)	C++14	100 / 100	65 ms	13136 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int dp[500069], n, a, mx, p[500069];
long long ps[500069];

int main() 
{
    int i, j;
    scanf("%d", &n);
    for (i=1; i<=n; i++)
    {
        scanf("%d", &a);
        ps[i] = ps[i-1]+a;
    }
    for (i=1; i<=n; i++)
    {
        p[i] = max(p[i-1], p[i]);
        dp[i] = dp[p[i]]+1;
        j = lower_bound(ps+1, ps+n+1, 2*ps[i]-ps[p[i]])-ps;
        p[j] = i;
    }
    printf("%d\n", dp[n]);
}

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

segments.cpp: In function 'int main()':
segments.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
segments.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%d", &a);
      |         ~~~~~^~~~~~~~~~

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