oj.uz

답안 #134135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134135 2019-07-22T06:31:55 Z mirbek01 K개의 묶음 (IZhO14_blocks) C++11
0 / 100
 13 ms 1400 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];
	
	for(int i = 1; i <= n; i ++){
		dp[1][i] = max(dp[1][i - 1], a[i]);
	}
	
	for(int i = 2; i <= k; i ++){
		pt = 0;
		deque < pair <int, int> > dq;
		for(int j = i; j <= n; j ++){
			while(pt > 0 && a[ stk[pt] ] < a[j])
				pt --;
			stk[++ pt] = j;
			pf[pt] = 1e9;
			while(!dq.empty() && dq.back().first > dp[i - 1][j - 1])
				dq.pop_back();
			dq.push_back({dp[i - 1][j - 1], j - 1});
			while(!dq.empty() && dq.front().second < max(stk[pt - 1], i - 1))
				dq.pop_front();			
			pf[pt] = dq.front().first;
			pf[pt] += a[j];
			if(pt > 1)
				pf[pt] = min(pf[pt - 1], pf[pt]);
			dp[i][j] = pf[pt];
		}
	}
	
	cout << dp[k][n] << endl;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Incorrect 2 ms 376 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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