提出 #47013770
ソースコード 拡げる
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//template
using ll = long long;
using ull = unsigned long long;
const int inf = INT_MAX/2;
const ll infl = LONG_MAX/2;
#define OVERLOAD(e1, e2, e3, e4, NAME, ...) NAME
#define REP1(i, b) for (ll i = 0, i##_len = ll(b); i < i##_len; i++)
#define REP2(i, a, b) for (ll i = ll(a), i##_len = ll(b); i < i##_len; i++)
#define REP3(i, a, b, c) for (ll i = ll(a), i##_len = ll(b); i < i##_len; i += ll(c))
#define rep(...) OVERLOAD(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define REPS1(i, b) for (ll i = 0, i##_len = ll(b); i <= i##_len; i++)
#define REPS2(i, a, b) for (ll i = ll(a), i##_len = ll(b); i <= i##_len; i++)
#define REPS3(i, a, b, c) for (ll i = ll(a), i##_len = ll(b); i <= i##_len; i += ll(c))
#define reps(...) OVERLOAD(__VA_ARGS__, REPS3, REPS2, REPS1)(__VA_ARGS__)
#define RREP1(i, a) for (ll i = ll(a); i >= 0; i--)
#define RREP2(i, a, b) for (ll i = ll(a), i##_len = ll(b); i >= i##_len; i--)
#define RREP3(i, a, b, c) for (ll i = ll(a), i##_len = ll(b); i >= i##_len; i -= ll(c))
#define rrep(...) OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)
#define vrep(i, vec) for (auto &i: vec)
#define all(x) (x).begin(), (x).end()
#define Yes(bool) if(bool) {println("Yes");} else {println("No");}
const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117;
template<class T> double rad(const T theta) { return theta*pi/180; }
ll mpow(ll x, ll n) { ll ret = 1; while (n > 0) { if (n & 1) ret *= x; x *= x; n >>= 1; } return ret; }
void printd() { cout << '\n'; } template<class T, class... Ts> void printd(const T& a, const Ts&... b) { cout << setprecision(20) << a; if (sizeof...(b) != 0) {cout << ' ';}; printd(b...); }
void println() { cout << '\n'; } template<class T, class... Ts> void println(const T& a, const Ts&... b) { cout << a; if (sizeof...(b) != 0) {cout << ' ';}; println(b...); }
void print() {} template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; if (sizeof...(b) != 0) {cout << ' ';}; print(b...); }
template<class T> void printv(const T vec) { int i = 0; int s = vec.size(); vrep(v, vec) { print(v); i++; if (i != s) print(' '); } println(); }
template<class T> void printvv(const T vec) { vrep(v, vec) { printv(v); } }
void in() {} template<class T, class... Ts> void in(T& a, Ts&... b) { cin >> a; in(b...); }
int main() {
ll N, M;
in(N, M);
vector<ll> A(N, 0);
rep(i, N) in(A[i]);
sort(all(A));
ll ans = 0;
vrep(a, A) {
ll l = lower_bound(all(A), a) - A.begin();
ll r = lower_bound(all(A), a+M) - A.begin();
ans = max(ans, r-l);
}
println(ans);
return 0;
}
提出情報
| 提出日時 |
|
| 問題 |
C - Peak |
| ユーザ |
kaede2912 |
| 言語 |
C++ 23 (gcc 12.2) |
| 得点 |
300 |
| コード長 |
2823 Byte |
| 結果 |
AC |
| 実行時間 |
117 ms |
| メモリ |
5600 KiB |
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
300 / 300 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
| All |
sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| sample_01.txt |
AC |
1 ms |
3500 KiB |
| sample_02.txt |
AC |
1 ms |
3516 KiB |
| sample_03.txt |
AC |
1 ms |
3472 KiB |
| test_01.txt |
AC |
1 ms |
3672 KiB |
| test_02.txt |
AC |
1 ms |
3588 KiB |
| test_03.txt |
AC |
1 ms |
3668 KiB |
| test_04.txt |
AC |
1 ms |
3556 KiB |
| test_05.txt |
AC |
1 ms |
3472 KiB |
| test_06.txt |
AC |
84 ms |
5540 KiB |
| test_07.txt |
AC |
90 ms |
5036 KiB |
| test_08.txt |
AC |
104 ms |
5252 KiB |
| test_09.txt |
AC |
115 ms |
5512 KiB |
| test_10.txt |
AC |
67 ms |
4468 KiB |
| test_11.txt |
AC |
36 ms |
4116 KiB |
| test_12.txt |
AC |
117 ms |
5520 KiB |
| test_13.txt |
AC |
41 ms |
3880 KiB |
| test_14.txt |
AC |
11 ms |
3564 KiB |
| test_15.txt |
AC |
14 ms |
3464 KiB |
| test_16.txt |
AC |
69 ms |
4468 KiB |
| test_17.txt |
AC |
84 ms |
4944 KiB |
| test_18.txt |
AC |
48 ms |
4208 KiB |
| test_19.txt |
AC |
38 ms |
3940 KiB |
| test_20.txt |
AC |
114 ms |
5596 KiB |
| test_21.txt |
AC |
114 ms |
5472 KiB |
| test_22.txt |
AC |
114 ms |
5460 KiB |
| test_23.txt |
AC |
109 ms |
5600 KiB |
| test_24.txt |
AC |
112 ms |
5528 KiB |
| test_25.txt |
AC |
107 ms |
5480 KiB |
| test_26.txt |
AC |
112 ms |
5468 KiB |
| test_27.txt |
AC |
110 ms |
5468 KiB |
| test_28.txt |
AC |
85 ms |
4928 KiB |
| test_29.txt |
AC |
12 ms |
3452 KiB |
| test_30.txt |
AC |
108 ms |
5596 KiB |
| test_31.txt |
AC |
86 ms |
5144 KiB |
| test_32.txt |
AC |
87 ms |
5044 KiB |
| test_33.txt |
AC |
107 ms |
5464 KiB |