제출 #1278172

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

sequence

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
/**zagaro & lauren <3**/
#define mod 1000000007 //1e9 + 7
#define pi acos(-1)
#define wl while
#define str string
#define ENDL "\n"
#define sal ' '
#define tp_set ll
#define prc(n) cout.precision(n);cout<<fixed;
#define ord_set tree<tp_set, null_type, less<tp_set>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef bool bl;
typedef char car;
using namespace std;
using namespace __gnu_pbds;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, k, r=0, a=0;
    cin>>n>>k;
    vector<ll> prf(n+1);
    vector<pair<ll,ll> > vec;
    vector<ll> res;
    for(int i=1;i<=n;i++){
        cin>>prf[i];
        prf[i] += prf[i-1];
    }
    for(int i=1;i<n;i++)vec.push_back({(prf[i]-prf[i-1])*(prf[n]-prf[i]),i});
    sort(vec.rbegin(), vec.rend());
    for(int i=0;i<k;i++)res.push_back(vec[i].second);
    sort(res.begin(), res.end());
    for(auto x: res){
        r += (prf[n]-prf[x])*(prf[x]-prf[a]);
        a = x;
    }
    cout<<r<<ENDL;
    for(auto x: res)cout<<x<<sal;
    cout<<ENDL;
    return 0;
}

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