제출 #1091278

#제출 시각아이디문제언어결과실행 시간메모리
1091278owieczkaGap (APIO16_gap)C++17
0 / 100
3066 ms524288 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; #define ll long long vector<ll> points; long long findGap(int T, int N) { ll s = 0; ll t = 1e18; ll b, e; ll n = N; MinMax(s, t, &b, &e); // musze podzielic na przedziały ll prz = (e - b)/n + 1; ll mn, mx; points.push_back(b); for (int i = b + 1; i < e; i+=prz) { MinMax(i, i + prz - 1, &mn, &mx); points.push_back(mn); points.push_back(mx); } mx = 0; for (int i = 1; i < points.size(); i++) { mx = max(points[i] - points[i-1], mx); } return mx; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |    for (int i = 1; i < points.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...