제출 #122166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122166		brcode	휴가 (IOI14_holiday)	C++14	47 / 100	5012 ms	2956 KiB

holiday

#include <iostream>
#include <queue>
#include <holiday.h>
using namespace std;
 
long long int findMaxAttraction(int n, int start, int d,int attraction[]){
    if(start == 0){
        priority_queue<long long> pq;
        long long sum = 0;
        long long ans = 0;
        for(long long i=0;i<n;i++){
            pq.push(-1*attraction[i]);
            sum+=attraction[i];
            while(pq.size()+i>d){
                long long hold = pq.top();
                sum+=hold;
                pq.pop();
            }
            ans= max(sum,ans);
        }
        return ans;
    }else{
        long long ans = 0;
        
        for(long long l=0;l<=start;l++){
            priority_queue<long long> pq;
            long long sum = 0;
            for(long long i=l;i<start;i++){
                pq.push(-1*attraction[i]);
                sum+=attraction[i];
            }
            for(long long r=start;r<n;r++){
                if(r-l>=d){
                    break;
                }
                pq.push(-1*attraction[r]);
                sum+=attraction[r];
                
                while(pq.size() && pq.size()+(r-l)+min(start-l,r-start)>d){
                    long long hold = pq.top();
                    
                    sum+=hold;
                    
                    pq.pop();
                }
                ans = max(ans,sum);
                
            }
        }
        return ans;
    }
    
}

컴파일 시 표준 에러 (stderr) 메시지

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:14:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(pq.size()+i>d){
                   ~~~~~~~~~~~^~
holiday.cpp:39:72: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(pq.size() && pq.size()+(r-l)+min(start-l,r-start)>d){
                                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~

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