제출 #1033354

#제출 시각아이디문제언어결과실행 시간메모리
1033354onbert휴가 (IOI14_holiday)C++17
47 / 100
5043 ms3236 KiB
#include "holiday.h" #include <bits/stdc++.h> using namespace std; #define int long long const int maxn = 1e5 + 5; int n, a[maxn]; int solve(int s, int d) { int ans = 0, curans = 0; priority_queue<int, vector<int>, greater<int>> pq; for (int i=s;i<=n;i++) { pq.push(a[i]), curans += a[i]; while (pq.size() > 0 && i-s + pq.size() > d) { curans -= pq.top(); pq.pop(); } ans = max(curans, ans); } return ans; } int findMaxAttraction(int32_t N, int32_t S, int32_t d, int32_t A[]) { n = N, S++; for (int i=1;i<=n;i++) a[i] = A[i-1]; if (S==1) return solve(1, d); int ans = 0; for (int i=S, D=d; i>=1 && D>=1; i--, D--) ans = max(solve(i, D), ans); reverse(a+1, a+n+1); S = n+1-S; for (int i=S, D=d; i>=1 && D>=1; i--, D--) ans = max(solve(i, D), ans); return ans; }

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

holiday.cpp: In function 'long long int solve(long long int, long long int)':
holiday.cpp:13:49: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   13 |         while (pq.size() > 0 && i-s + pq.size() > d) {
      |                                 ~~~~~~~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...