Submission #497546

#	Time	Username	Problem	Language	Result	Execution time	Memory
497546		kingline	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	332 KiB

segments

/*#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")*/
#include <bits/stdc++.h>
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
//#define file(data) freopen(data".in", "r", stdin); freopen(data".out", "w", stdout);
#define pb push_back
//#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(data) data.begin() , data.end()
#define endl '\n'
//freopen("nenokku_easy.in", "r", stdin);
//freopen("nenokku_easy.out", "w", stdout);
#define int long long
#define pii pair < int, int >
#define pll pair < long long, long long >

using namespace std;

typedef long long ll;
const int N = 1e6 + 5;
const int M = 3005;
const int mod = 1e9 + 7;

int n, a[N], pref[N];
pair < int, int > dp[N];

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //file("pieaters");
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
        dp[i] = {i, 1};
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j < i; j++) {
            if(dp[i - j].second + 1 > dp[i].second && pref[i] - pref[i - j] > pref[i - j - 1] - pref[i - j - dp[i - j].first]) {
                dp[i] = {pref[i] - pref[i - j], j + 1};
            }
        }
    }
    cout << dp[n].second;
}

Compilation message (stderr)

segments.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main() {
      | ^~~~

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