제출 #169362

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

segments

#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
const int N = 500005;

int n;
int a[N];
long long p[N];

pair<int, long long> dp[N];

int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++i)
        p[i] = p[i - 1] + a[i];
    for (int i = 1; i <= n; ++i)
    {
        int l = 1, r = i;
        while (l <= r)
        {
            int m = (l + r) / 2;
            if (dp[m - 1].second <= p[i] - p[m - 1])
            {
                dp[i] = m_p(dp[m - 1].first + 1, p[i] - p[m - 1]);
                l = m + 1;
            }
            else
                r = m - 1;
        }
    }
    printf("%d\n", dp[n].first);
    return 0;
}

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

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

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