Submission #444689

#	Time	Username	Problem	Language	Result	Execution time	Memory
444689		NaimSS	K blocks (IZhO14_blocks)	C++14	100 / 100	296 ms	89472 KiB

blocks

#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
//inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
  b%=m;
  ll ans = 1;
  for (; e; b = b * b % m, e /= 2)
      if (e & 1) ans = ans * b % m;
  return ans;
}

// debug:
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ 
  cerr << ' ' << H; 
  dbg_out(T...); 
}
#ifdef LOCAL
#define dbg(...) cerr<<"(" << #__VA_ARGS__<<"):" , dbg_out(__VA_ARGS__) , cerr << endl
#else
#define dbg(...)
#endif
//

const int N = 100100;
ll A[N],B[N];
ll dp[100100][110];
int32_t main(){
  fastio;
  int n,k;
  cin >> n >> k;
  rep(i,0,100100)rep(j,0,110)dp[i][j] = 1e18;
  ll mx=0;
  rep(i,1,n+1){
    cin >> A[i];
    B[i] = A[i];
    mx=max(mx,A[i]);
    dp[i][1] = mx;
  }
  sort(B+1,B+1+n,greater<ll>());


  rep(i,2,k+1){
    stack<pll> st;
    rep(j,1,n+1){
      ll val = dp[j-1][i-1];
      while(!st.empty() && st.top().ff < A[j]){
        val=min(val,st.top().ss);
        st.pop();
      }

      if(st.empty() || st.top().ff + st.top().ss > A[j] + val){
        st.push(pll(A[j],val));
      }
      if(j>=i)
        dp[j][i] = st.top().ff + st.top().ss;

    }

  }

  cout << dp[n][k] << endl;


  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

• Subtask 1: 14 / 14
• Subtask 2: 18 / 18
• Subtask 3: 21 / 21
• Subtask 4: 47 / 47