제출 #1040380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1040380		vjudge1	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	1062 ms	86456 KiB

blocks

#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n , k ; 
int a [maxn] ;

int L [maxn][20] ; 

int dp [maxn][109] ; 
void build_rmq () 
{
	for ( int i = 1 ; i <= n ; i ++ ) L [i][0] = a[i] ; 
	for ( int j = 1 ; j <= __lg(n) ; j ++ ) 
	{
		for ( int i = 1 ; i <= n-(1<<j)+1 ; i ++ ) 
		{
			L [i][j] = max (L[i][j-1],L[i+(1<<(j-1))][j-1]) ; 
		}
	}
}
int get ( int l , int r ) 
{
	int x = __lg(r-l+1) ; 
	return max (L[l][x],L[r-(1<<x)+1][x]) ;
} 
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ; 	
	cin >> n >> k ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ; 
	build_rmq () ; 
	
	memset ( dp,0x3f,sizeof dp) ; 

	dp [0][0] = 0 ; 

	for ( int i = 1 ; i <= n ; i ++ )
	{
		for ( int t = k ; t >= 1 ; t -- ) 
		{
			for ( int j = 1 ; j <= i ; j ++ ) 
			{
				chkmin (dp[i][t],dp[j-1][t-1]+get(j,i)) ; 
			}
		}
	}
	cout << dp [n][k] ; 
}

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp: In function 'void rf()':
blocks.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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