제출 #423395

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

sequence

//Suleyman Atayew

#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#include <map>
#include <set>
 
#define N 200010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <ll, ll>
#define sz(a) (ll)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }

using namespace std;

ll n, k;
ll v[N], p[N], dp[N][300];

int main()
{
    ios::sync_with_stdio(false);
	cin.tie(0);

    cin >> n >> k;

    for(ll i = 1; i <= n; i++)
        cin >> v[i], p[i] = p[i-1] + v[i];

    for(ll i = 1; i <= k; i++) {
        ll in = i;

        for(ll h = i+1; h <= n; h++) {
            while(in+1 < h && (p[h] - p[in-1]) * p[in-1] + dp[in-1][i-1] < (p[h] - p[in]) * p[in] + dp[in][i-1])
                in++;
            
            dp[h][i] = (p[h] - p[in-1]) * p[in-1] + dp[in-1][i-1];

            // cout << dp[h][i] << " ";
        }
        // cout << "\n";
    }

    cout << dp[n][k];
}
/*
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