oj.uz

답안 #134101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134101 2019-07-22T04:41:42 Z mirbek01 K개의 묶음 (IZhO14_blocks) C++11
0 / 100
 52 ms 40356 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

int n, a[N], k, dp[102][N];
int stk[N], pt, pf[N];

int main(){
	
	cin >> n >> k;
	
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	
	memset(dp, 0x3f3f3f3f, sizeof(dp));
	
	dp[1][1] = a[1];
	
	for(int i = 2; i <= n; i ++){
		dp[1][i] = max(dp[1][i - 1], a[i]);
	}
	
	for(int i = 2; i <= k; i ++){
		pt = 0;
		for(int j = 1; j <= n; j ++){
			while(pt >= 1 &&  a[ stk[pt] ] <= a[j])
				pt --;
			stk[++ pt] = i;
			pf[pt] = dp[i - 1][ stk[pt - 1] + 1 ] + a[j];
			if(pt > 1)
				pf[pt] = min(pf[pt], pf[pt - 1]);
			dp[i][j] = pf[pt];
		}
	}
	
	cout << dp[k][n] << endl;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 40312 KB Output is correct
2 Correct 35 ms 40312 KB Output is correct
3 Correct 36 ms 40276 KB Output is correct
4 Correct 35 ms 40312 KB Output is correct
5 Correct 35 ms 40312 KB Output is correct
6 Correct 35 ms 40184 KB Output is correct
7 Correct 36 ms 40184 KB Output is correct
8 Correct 35 ms 40312 KB Output is correct
9 Incorrect 36 ms 40264 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 40308 KB Output is correct
2 Correct 35 ms 40312 KB Output is correct
3 Correct 36 ms 40232 KB Output is correct
4 Correct 35 ms 40312 KB Output is correct
5 Correct 35 ms 40256 KB Output is correct
6 Correct 36 ms 40312 KB Output is correct
7 Correct 36 ms 40184 KB Output is correct
8 Correct 35 ms 40284 KB Output is correct
9 Incorrect 36 ms 40184 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 52 ms 40312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 42 ms 40356 KB Output isn't correct
2 Halted 0 ms 0 KB -