Submission #337571

#	Time	Username	Problem	Language	Result	Execution time	Memory
337571		Kerim	K개의 묶음 (IZhO14_blocks)	C++17	100 / 100	161 ms	40980 KiB

blocks

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int dp[101][MAXN],arr[MAXN];
int main(){
    //freopen("file.in", "r", stdin);
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
    	scanf("%d",arr+i);
    	dp[1][i]=max(dp[1][i-1],arr[i]);
    }
    for(int i=2;i<=k;i++){dp[i-1][0]=INF;
    	stack<PII>st;
    	for(int j=1;j<=n;j++){
    		int odp=dp[i-1][j-1];
			while(!st.empty() and st.top().ff<arr[j]){
				umin(odp,st.top().ss);
				st.pop();	
			}
			if(st.empty() or arr[j]+odp<st.top().ff+st.top().ss)
				st.push(mp(arr[j],odp));
			if(j>=i)
				dp[i][j]=st.top().ff+st.top().ss;
			else
				dp[i][j]=INF;
		}
    }printf("%d\n",dp[k][n]);
 	return 0;
}

Compilation message (stderr)

blocks.cpp: In function 'int main()':
blocks.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |     scanf("%d%d",&n,&k);
      |     ~~~~~^~~~~~~~~~~~~~
blocks.cpp:26:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |      scanf("%d",arr+i);
      |      ~~~~~^~~~~~~~~~~~

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