oj.uz

답안 #17450

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17450 2015-12-13T13:36:48 Z azecoder K개의 묶음 (IZhO14_blocks) C++
0 / 100
 0 ms 166568 KB 
#include <iostream>
#include <cstdio>

#define MAXN 100005
#define intt long long

using namespace std;

intt n , k , dp[MAXN][105] , q[MAXN][105] , a[MAXN] , null ;

int main ( ) {
	
	//freopen ( "blocks.in" , "r" , stdin ) ;
	//freopen ( "blocks.out" , "w" , stdout ) ;
	
	cin >> n >> k ;
	
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a[i] ;
	
	q[1][1] = a[1] ;
	
	dp[1][1] = a[1] ;
	
	for ( intt i = 1 ; i <= n ; i ++ ) {
		
		dp[i][1] = max ( q[i - 1][1] , a[i] ) ;
		
		q[i][1] = dp[i][1] ;
		
		for ( int v = 2 ; v <= min ( i , k ) ; v ++ ) {
			
			dp[i][v] = 5043434334 ;
			
			if ( i - 1 >= v ) {
			
				dp[i][v] = dp[i - 1][v] + max ( a[i] - q[i - 1][v] , null ) ;
			
				q[i][v] = max ( q[i - 1][v] , a[i] ) ;
			
			}
			
			if ( dp[i][v] > dp[i - 1][v - 1] + a[i] ) {
				
				dp[i][v] = dp[i - 1][v - 1] + a[i] ;
				
				q[i][v] = a[i] ;
					
			}
			
		}
			
	}
	
	cout << dp[n][k] << endl ;
	
	return 0 ;
		
}

Subtask #1
0.0 / 14.0

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

Subtask #2
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #3
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #4
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -