oj.uz

답안 #848610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848610 2023-09-13T02:46:39 Z wakandaaa K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 5 ms 41560 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e5 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, m;
int a[N];
int f[105][N];

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

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
    	cin >> a[i];

    memset(f, 0x3f, sizeof f);

    f[0][0] = 0;

    for (int k = 1; k <= m; ++k) {
    	stack<pair<int, int> > st;
    	for (int i = k; i <= n; ++i) {
    		int res = f[k - 1][i - 1];
    		while (st.size() && a[st.top().se] <= a[i]) {
    			res = min(res, st.top().fi);
    			st.pop();
    		}
    		int j = st.size() ? st.top().se : 0;
    		// f[k][i] = min(f[k][j], res + a[i]);
    		mini(f[k][i], res + a[i]);
    		st.push(mp(res, i));
    	}
    }

    cout << f[m][n];

    return 0;
}

/*

*/

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:66:11: warning: unused variable 'j' [-Wunused-variable]
   66 |       int j = st.size() ? st.top().se : 0;
      |           ^

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41560 KB Output is correct
2 Incorrect 5 ms 41560 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41560 KB Output is correct
2 Incorrect 5 ms 41560 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41560 KB Output is correct
2 Incorrect 5 ms 41560 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41560 KB Output is correct
2 Incorrect 5 ms 41560 KB Output isn't correct
3 Halted 0 ms 0 KB -