제출 #1157013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1157013		arkanefury	수열 (APIO14_sequence)	C++20	0 / 100	0 ms	324 KiB

sequence

#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#define F first
#define sz size()
#define S second
#define in insert
#define double long double
#define lb lower_bound
#define int long long
#define all(v) v.begin(), v.end()
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const int N = 1e5+5;
int n,m,tt,sum=0,l, r, x, y, cnt, block = 448, res;
int a[N], b[N], c[N], ans, pref[N];
string s;
vector<int>v, vec;
void rec(int pos = 0, int sum = 0, int lp = 0){
    if(lp == m){
        if(ans < sum)ans = sum, vec = v;
        return;
    }
    FOR(i, pos+1, n, 1){
        v.pb(i);
        rec(i, sum + (pref[i] - pref[pos]) * (pref[n] - pref[i]), lp + 1 );
        v.pop_back();
    }
}
void solve() {
    cin >> n >> m;
    FOR(i, 1, n, 1)cin >> a[i], pref[i] = pref[i-1] + a[i];
    rec();
    cout << ans << '\n';
    for(auto i : vec)cout << i << ' ';
}
signed main()
{
    nikita
    tt = 1;
    if(!tt)cin >> tt;
    FOR(i, 1, tt, 1){
    solve();
    }
}

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