제출 #996779

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996779		daffuwu	Bigger segments (IZhO19_segments)	C++14	27 / 100	1547 ms	16720 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[3069][3069], n, a;
long long ps[500069];

int main() 
{
    int i, j, idx;
    scanf("%d", &n);
    for (i=1; i<=n; i++)
    {
        scanf("%d", &a);
        ps[i] = ps[i-1]+a;
    }
    ps[n+1] = 1e17;
    for (i=1; i<=n; i++)
    {
        for (idx=i+1; idx<=n+1; idx++)
        {
            dp[i][idx] = -1e9;
            for (j=0; j<=i-1; j++)
            {
                if (ps[idx]-ps[i]>=ps[i]-ps[j]) dp[i][idx] = max(dp[i][idx], 1+dp[j][i]);
            }
        }
    }
    printf("%d\n", dp[n][n+1]);    
}

컴파일 시 표준 에러 (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: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27