Submission #499038

#	Time	Username	Problem	Language	Result	Execution time	Memory
499038		tmn2005	K개의 묶음 (IZhO14_blocks)	C++17	53 / 100	1086 ms	1924 KiB

blocks

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e5+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],c;
int arr[150][N];

main(){
	NeedForSpeed
    cin>>n>>m;
    
    for(int i=1; i<=n; i++){
    	cin>>a[i];
    	
    	o += a[i];
    	if(i <= m)arr[i][i] = o;
    	
		mx = max(mx, a[i]);
    	arr[1][i] = mx;
	}
	for(int i=2; i<=m; i++){
		for(int j=i+1; j<=n; j++){
			k = a[j], mn = INF;
			for(int l=j-1; l>=i-1; l--){
				if(arr[i-1][l] + k < mn){
					mn = arr[i-1][l] + k;	
				}
				k = max(k, a[l]);
			}
			arr[i][j] = mn;
		}
	}
	cout<<arr[m][n];




	return 0;
}

Compilation message (stderr)

blocks.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main(){
      | ^~~~

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