結果

問題 No.1117 数列分割
ユーザー HEXAebmrHEXAebmr
提出日時 2020-07-18 18:00:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,488 ms / 3,000 ms
コード長 3,955 bytes
コンパイル時間 1,023 ms
コンパイル使用メモリ 110,852 KB
実行使用メモリ 27,648 KB
最終ジャッジ日時 2024-05-08 01:05:04
合計ジャッジ時間 10,431 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 16 ms
7,936 KB
testcase_04 AC 67 ms
7,552 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 199 ms
7,936 KB
testcase_09 AC 26 ms
5,376 KB
testcase_10 AC 270 ms
8,064 KB
testcase_11 AC 1,040 ms
17,536 KB
testcase_12 AC 431 ms
16,768 KB
testcase_13 AC 29 ms
12,544 KB
testcase_14 AC 1,087 ms
21,248 KB
testcase_15 AC 53 ms
13,696 KB
testcase_16 AC 1,372 ms
27,648 KB
testcase_17 AC 844 ms
7,552 KB
testcase_18 AC 20 ms
15,360 KB
testcase_19 AC 20 ms
15,488 KB
testcase_20 AC 2,488 ms
26,624 KB
testcase_21 AC 19 ms
15,488 KB
testcase_22 AC 25 ms
16,896 KB
testcase_23 AC 28 ms
16,768 KB
testcase_24 AC 39 ms
16,512 KB
testcase_25 AC 38 ms
16,640 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 18 ms
5,888 KB
testcase_28 AC 17 ms
5,760 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

// modint

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

ll A[3007],dp[3007][3007];

int main(){
  ll N,K,M;
  cin >> N >> K >> M;
  rep(i,N){
    cin >> A[i+1];
  }
  A[0]=0;
  Rep(i,1,N+1){
    A[i]=A[i]+A[i-1];
  }
  rep(i,N+1){
    Rep(j,min(i,1ll),min(i+1,K)){
      Rep(k,i+1,min(i+M+1,N+2-(K-j))){
        dp[j+1][k]=max(dp[j+1][k],dp[j][i]+abs(A[i]-A[k]));
        //cout << i << " " << j << " " << k << " " << dp[j+1][k]<< endl;
      }
    }
  }
  cout << dp[K][N] << endl;
}
0