Submission #376294

#	Time	Username	Problem	Language	Result	Execution time	Memory
376294		joelau	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	364 KiB

segments

#include <bits/stdc++.h>
using namespace std;

int N,dp[3001][3001];
long long A[500001];

int main() {
    scanf("%d", &N);
    A[0] = 0;
    for (int i = 1; i <= N; ++i) {
        scanf("%lld", &A[i]);
        A[i] += A[i-1];
    }
    for (int i = 0; i < N; ++i) {
        dp[0][i] = 1;
        int n = 0;
        for (int j = 1; j <= i; ++j) {
            while (n < j && A[i+1] - A[j] >= A[j] - A[n]) n++;
            dp[j][i] = dp[j-1][i];
            if (n != 0) dp[j][i] = max(dp[j][i],dp[n-1][j-1]+1);
        }
    }
    printf("%d", dp[N-1][N-1]);

    return 0;
}

Compilation message (stderr)

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

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