제출 #288289

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
288289		AKaan37	휴가 (IOI14_holiday)	C++17	23 / 100	38 ms	6264 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],k,flag,t;
lo cev;
multiset<lo> st;
string s;
vector<int> v;

long long int findMaxAttraction(int n, int start, int d, int a[]) {
	lo say=0;
	lo mx=0;
	for(int i=0;i<n;i++){
		int git=d-i;
		if(git<0)continue;
		cev+=a[i];
		st.insert(a[i]);
		say++;
		//~ cout<<say+1<<endl;
		while(say>git){
			auto it=st.begin();
			cev-=*it;
			st.erase(it);
			say--;
		}
		mx=max(mx,cev);
	}
    return mx;
}

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