Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Рубрика "АНЕКРВ КОММЕНТАХ":
- В дверь постучали 1024 раза. Килобайт - подумал Штирлиц.
- Дурак - подумали 128 осьминогов
- */
- #define _CRT_SECURE_NO_DEPRECATE
- #pragma warning(disable:4996)
- //#pragma optimize( "g", on )
- #include <iostream>
- #define _USE_MATH_DEFINES
- #include <math.h>
- #include <cmath>
- #include <vector>
- #include <map>
- #include <stack>
- #include <set>
- #include <queue>
- #include <iomanip>
- #include <deque>
- #include <string>
- #include <algorithm>
- #include <numeric>
- using namespace std;
- #define ll long long
- #define ull unsigned long long
- map<int, int> ids;
- vector<int> nm;
- int getId(int num) {
- if (ids.count(num))
- return ids[num];
- ids[num] = nm.size();
- nm.push_back(num);
- }
- int main() {
- cin.tie(NULL);
- cout.tie(NULL);
- ios_base::sync_with_stdio(false);
- //freopen("INPUT.TXT", "r", stdin);
- //freopen("OUTPUT.TXT", "w", stdout);
- //cout << fixed << setprecision(15);
- int n, k, cur;
- cin >> n >> k;
- set<int> st;
- map<int, int> cn;
- deque<int> deq;
- for (int i = 0; i < n; i++) {
- cin >> cur;
- deq.push_back(cur);
- if (!cn.count(cur))
- cn[cur] = 1;
- else {
- if (cn[cur] == 1)
- st.erase(cur);
- cn[cur]++;
- }
- if (cn[cur] == 1)
- st.insert(cur);
- /*
- 6 4 3 3 3 4 4 2
- */
- /*
- cout << " cur " << cur << ": " << cn[cur] << '\n' << " _";
- for (auto bg = st.begin(); bg != st.end(); bg++)
- cout << *bg << ' ';
- cout << '\n';*/
- if (deq.size() >= k) {
- if (deq.size() > k) {
- cn[deq.front()]--;
- //cout << " deleting " << deq.front() << ": " << cn[deq.front()] << '\n' << " _";
- if (cn[deq.front()] == 0)
- st.erase(deq.front());
- if (cn[deq.front()] == 1)
- st.insert(deq.front());
- deq.pop_front();
- /*
- for (auto bg = st.begin(); bg != st.end(); bg++)
- cout << *bg << ' ';
- cout << '\n';*/
- }
- cout << ((st.size() > 0) ? to_string(*(--st.end())) : "Nothing") << '\n';
- }
- //if (i < k) {
- //
- // continue;
- //}
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement