제출 #498307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
498307		kingline	수열 (APIO14_sequence)	C++17	11 / 100	2083 ms	1996 KiB

sequence

/*#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 = 2e5 + 5;
const int M = 305;
const int mod = 1e9 + 7;

int n, k, a[N], res, use;

vector < int > dv;
void rec(int l, int r, int last) {
    if(l >= r) return;
    last++;
    while(last < dv.size() && dv[last] < l) last++;
    if(last == dv.size() || r <= dv[last]) return;
    int lef = 0, righ = 0;
    for(int i = l; i <= dv[last]; i++) {
        lef += a[i];
    }
    for(int i = dv[last] + 1; i <= r; i++) {
        righ += a[i];
    }
    res += lef * righ;
    ++use;
    rec(l, dv[last], last);
    rec(dv[last] + 1, r, last);
}

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //file("pieaters");
    cin >> n >> k;
    vector < int > br;
    for(int i = 1; i <= n; i++) {
        br.pb(i);
        cin >> a[i];
    }
    int ans = 0;
    vector < int > path;
    do {
        for(int i = 0; i < k; i++) dv.pb(br[i]);
        res = 0;
        rec(1, n, -1);
        if(res >= ans && use == k) {
            path = dv;
            ans = res;
        }
        use = 0;
        dv.clear();
    } while(next_permutation(all(br)));
    reverse(all(path));
    cout << ans << endl;
    for(int i = 0; i < path.size(); i++) {
        cout << path[i] << " ";
    }
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'void rec(long long int, long long int, long long int)':
sequence.cpp:33:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     while(last < dv.size() && dv[last] < l) last++;
      |           ~~~~~^~~~~~~~~~~
sequence.cpp:34:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     if(last == dv.size() || r <= dv[last]) return;
      |        ~~~~~^~~~~~~~~~~~
sequence.cpp: At global scope:
sequence.cpp:48:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   48 | main() {
      | ^~~~
sequence.cpp: In function 'int main()':
sequence.cpp:74:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(int i = 0; i < path.size(); i++) {
      |                    ~~^~~~~~~~~~~~~

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