제출 #254552

#제출 시각아이디문제언어결과실행 시간메모리
254552b00n0rp휴가 (IOI14_holiday)C++17
47 / 100
5075 ms2868 KiB
#include"holiday.h" #include<bits/stdc++.h> using namespace std; long long int findMaxAttraction(int n, int start, int d, int attraction[]) { long long ans = 0; for(int l = 0; l <= start; l ++){ priority_queue<int,vector<int>,greater<int> > pq; long long cur = 0; for(int i = l; i < start; i ++){ pq.push(attraction[i]); cur += attraction[i]; } for(int r = start; r < n; r++){ int gg = d-2*min(start-l,r-start)-max(start-l,r-start); pq.push(attraction[r]); cur += attraction[r]; if(gg <= 0) break; while(pq.size() > gg){ cur -= pq.top(); pq.pop(); } ans = max(ans,cur); } } return ans; }

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

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:19:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       while(pq.size() > gg){
             ~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...