제출 #503484

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

sequence

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);
    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,k,arr[mxn],sum[mxn],idx[mxn],dp[mxn][205],mp[mxn][205];
int funk(int ind,int k){
    if(n-ind+1>=k+1){

    }
    else{
        return -INF;
    }
    if(k==0){
        if(ind<=n){
            return 0;
        }
        else{
            return -INF;
        }
    }
    int ans=0;
    for(int i=ind;i<=n;i++){
        ans=max(ans,(sum[i]-sum[ind-1])*(sum[n]-sum[i])+funk(i+1,k-1));
    }
    return ans;
}
void solve(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
        sum[i]=sum[i-1]+arr[i];
    }
    cout<<funk(1,k)<<endl;
}
signed main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
/*
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