oj.uz

답안 #672204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
672204 2022-12-15T04:17:46 Z Cutebol K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
//void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define Scaramouche ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define itn int
#define endl "\n"
#define ff first
#define cout cerr
#define ss second
   
const int N = 2e5 + 5 ;
const int mod = 1e9 + 7 ;
const int inf = 1e12 ;

int n , m ;
int a[N] ;
int dp[104][N] ;

void solve(){
	
	cin >> n >> m ;
	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 <= m ; i ++ )
		for ( int j = 1 ; j <= n; j ++ ) dp[i][j] = inf ;
	for ( int i = 2 ; i <= m ; i ++ ){
		stack <pair<int,int>> st ;
		for ( int j = i ; j <= n ; j ++ ){
			int last = dp[i-1][j-1] ;
			while ( !st.empty() && st.top().ff <= a[j] ){
				last =  min ( last , st.top().ss ) ;
				st.pop() ;
			}
			if ( st.empty() || st.top().ff <= a[j] )
				st.push({a[j],last}) ;
			
			dp[i][j] = min ( last + a[j] , st.top().ff + st.top().ss ) ;
		}
	}
	cout << dp[m][n] ;
}
 
signed main(){
//  fopn("talent") ;
//    Scaramouche ;
    int t = 1 ;
//      cin >> t ;
    while ( t -- ) solve() ; 
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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