oj.uz

답안 #501390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501390 2022-01-03T03:58:54 Z tmn2005 K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 356 KB 
#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_front

#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=1e6+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],dp[105][N],b,c;

main(){
	NeedForSpeed
    cin>>n>>k;
    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<=k; i++){
    	stack<pii>q;
    	for(int j=i; j<=n; j++){
    		int tmp = dp[i-1][j-1];
    		
    		while(!q.empty() && q.top().sc < a[j]){
    			tmp = min(tmp, q.top().sc);
    			q.pop();
			}
			if(q.empty() || q.top().fr + q.top().sc > tmp + a[j]){
				q.push({a[j], tmp});
			}
			dp[i][j] = q.top().fr + q.top().sc;
		}
	}
//	for(int i=1; i<=k; i++){
//		for(int j=1; j<=n; j++){
//			cout<<dp[i][j]<<" ";
//		}
//		cout<<endl;
//	}
	cout<<dp[k][n];



	return 0;
}

Compilation message

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

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Incorrect 0 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Incorrect 0 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Incorrect 0 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -