제출 #498363

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
498363		vinnipuh01	수열 (APIO14_sequence)	C++17	0 / 100	14 ms	588 KiB

sequence

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
 
using namespace std;
 
const long long oo = 1000000000000000000;
 
long long int sum, ans = 0, mx = 0, mn = 1e9, num, pos;
 
 
/*
    ViHHiPuh
 
   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))
 
 
    cout << fixed << setprecision(6) << x;
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
 
    freopen ( "sum.in", "r", stdin )
*/



int main () {
	int n, m;
	cin >> n >> m;
	int a[ n + 1 ];
	for ( int i = 0; i < n; i ++ ) {
		cin >> a[ i ];
		sum += a[ i ];
	}
	mn = sum;
	ans = mx = 0;
	for ( int mask = 1; mask < ( 1 << ( n - 1 ) ); mask ++ ) {
		if ( __builtin_popcount( mask ) != m )
			continue;
		for ( int i = 0; i < n - 1; i ++ ) {
			num += a[ i ];
			sum -= a[ i ];
			if ( mask & ( 1 << i ) ) {
				ans += num * sum;
				num = 0;
			}
		}
		if ( mx < ans ) {
			mx = ans;
			pos = mask;
		}
		num = ans = 0;
		sum = mn;
	}
	cout << mx << "\n";
	for ( int i = 0; i < n - 1; i ++ ) {
		if ( pos & ( 1 << i ) )
			cout << i + 1 << " ";
	}
}

/*
7 3
4 1 3 4 0 2 3
*/

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