Submission #891435

#	Time	Username	Problem	Language	Result	Execution time	Memory
891435		nasam	Split the sequence (APIO14_sequence)	C++17	22 / 100	2037 ms	98128 KiB

sequence

/*************************************
*       author: Pham Huy Khanh       *
*************************************/
#include <bits/stdc++.h>
#define ll long long
#define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; i++)
#define FOD(i,b,a) for (int i = (b), _a = (a); i >= _a; i--)
#define FORE(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))
#define CNTBIT(x) __builtin_popcountll(x)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define left ___left
#define right ___right
#define pii pair<int, int>
#define DEBUG(n, a) FOR (i, 1, n) cout << a[i] << ' '; cout << endl;
#define endl "\n"
#define NAME "main"

using namespace std;

template<class X, class Y> bool maximize(X &x, Y y){ if (x < y){ x = y; return true; } return false; }
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y){ x = y; return true; } return false; }

#define  gogobruhbruh  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".ans", "w", stdout); }

const int MOD = 1e9 + 7;

void add(int &a, int b){ if ((a += b) >= MOD) a -= MOD; }
void sub(int &a, int b){ if ((a -= b) < 0) a += MOD; }
int muti(int a, int b){ return (1LL * a * b) % MOD; }
int Pow(int x, int y){ int res = 1; for (; y; y >>= 1){ if (y & 1) res = muti(res, x); x = muti(x, x); } return res; }

const int MAX = 1e5 + 7;
const int K = 1e2 + 7;
const ll INF = 1e18 + 7;

int num, lim;
ll sum[MAX], dp[MAX][K];
int trace[MAX][K];

void solve(){
    memset(dp, -0x3f, sizeof(dp));
    FOR (i, 0, num)
        dp[i][0] = 0;
    FOR (i, 1, num)
        FOR (j, 1, lim)
            FOD (k, i - 1, 0)
                if (maximize(dp[i][j], dp[k][j - 1] + sum[i] * sum[k] - sum[k] * sum[k]))
                    trace[i][j] = k;
    cout << dp[num][lim] << endl;
    for (num = trace[num][lim--]; lim >= 0; num = trace[num][lim--])
        cout << num << ' ';
}

void read(){
    cin >> num >> lim;
    FOR (i, 1, num)
        cin >> sum[i],
        sum[i] += sum[i - 1];
}

int main(){
    gogobruhbruh
    file("main");
    int test = 1;
    // cin >> test;
    while (test--)
      read(),
      solve();
}

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".ans", "w", stdout); }
      |                                                     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:70:5: note: in expansion of macro 'file'
   70 |     file("main");
      |     ^~~~
sequence.cpp:30:95: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".ans", "w", stdout); }
      |                                                                                       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:70:5: note: in expansion of macro 'file'
   70 |     file("main");
      |     ^~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29