Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, m; cin >> n; int maski[n]; vector<int> brojac(200, 0); vector<int> pref_sum(200, 0); int y = 0; for(int i = 0; i < n; i++){ cin >> maski[i]; brojac[maski[i]]++; } for(int i = 0; i <= 90; i++) { y += brojac[i]; pref_sum[i] = y; } cin >> m; int zenski[m]; for(int i = 0; i < m; i++){ cin >> zenski[i]; } int k, r; cin >> r >> k; sort(zenski, zenski + m); int L = 0; int R = k - 1; int s = 0; for(int i = k - 1; i < m; i++){ int temp = 0; int minimum = zenski[R] - r; int maksimum = zenski[L] + r; temp = pref_sum[maksimum] - pref_sum[max(minimum - 1, 0)]; if(temp > s){ s = temp; } L++; R++; } cout << s << endl; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
