제출 #18102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
18102		comet	휴가 (IOI14_holiday)	C++98	0 / 100	5000 ms	3296 KiB

holiday

#include "holiday.h"
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
typedef priority_queue<ll> pq;

int N,D;
ll a[100000];
ll b[100000];

ll f(int L,int R){
	pq Q;
	for(int i=L;i<=R;i++){
		Q.push(a[i]);
	}
	ll sum=0;
	for(int i=0;i<D-(R-L+1);i++){
		if(Q.empty())return sum;
		sum+=Q.top();
		Q.pop();
	}
	return sum;
}

ll findMaxAttraction(int n, int start, int d, int attraction[]){

	N=n;
	D=d;
	for(int i=0;i<n;i++){
		a[i]=attraction[i];
	}

	for(int i=start;i<n;i++){
		for(int j=start;(start-j)*2+(i-start)<=d;j--){
			if(j<0)break;
			b[i]=max(b[i],f(j,i));
		}
	}

	for(int i=start;i>=0;i--){
		for(int j=start;(j-start)*2+(start-i)<=d;j++){
			if(j>=n)break;
			b[i]=max(b[i],f(i,j));
		}
	}

	ll ans=0;

	for(int i=0;i<n;i++)ans=max(ans,b[i]);

	return ans;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53