Advertisement
tiom4eg

openol A 100

Jan 16th, 2023
534
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.92 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. // tiom4eg's precompiler options
  3. // POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
  4. // IO settings
  5. #define fastIO ios_base::sync_with_stdio(false); cin.tie(0)
  6. // Quick types
  7. #define ll long long
  8. #define ld long double
  9. #define ull unsigned long long
  10. #define pii pair <int, int>
  11. #define vi vector <int>
  12. #define mi vector <vector <int>>
  13. // Quick functions
  14. #define endl "\n"
  15. #define F first
  16. #define S second
  17. #define all(a) a.begin(), a.end()
  18. #define sz(a) (int)(a.size())
  19. #define pb push_back
  20. #define mp make_pair
  21. // Quick fors
  22. #define FOR(i, a, b) for (int i = a; i < b; ++i)
  23. #define FORS(i, a, b, c) for (int i = a; i < b; i += c)
  24. #define RFOR(i, a, b) for (int i = a; i >= b; --i)
  25. #define EACH(e, a) for (auto& e : a)
  26. // Pragmas
  27. #ifndef TIOM4EG
  28. #pragma GCC optimize("Ofast,unroll-loops") // let the chaos begin!
  29. #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt,tune=native")
  30. #pragma GCC comment(linker, "/stack:200000000")
  31. #endif
  32. // PBDS
  33. #include <ext/pb_ds/assoc_container.hpp>
  34. #include <ext/pb_ds/tree_policy.hpp>
  35. #define ordered_set tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update>
  36. #define ook order_of_key
  37. #define fbo find_by_order
  38. using namespace __gnu_pbds;
  39. // POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
  40. using namespace std;
  41. mt19937 rng(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
  42. #define int long long
  43. const int INF = 1e9 + 7, MAX = 400007, MD = 998244353, MOD = 499997371LL * 499999303, LG = 30, B = 31;
  44.  
  45. signed main() {
  46.     fastIO;
  47.     int n, k; cin >> n >> k;
  48.     vi a(n + 1), br; FOR(i, 1, n + 1) cin >> a[i];
  49.     int mx = 0;
  50.     FOR(i, 1, n + 1) {
  51.         mx = max(mx, a[i]);
  52.         if (i == mx) br.pb(i);
  53.     }
  54.     if (sz(br) < k) return !(cout << -1);
  55.     cout << br[sz(br) - k];
  56.     FOR(i, sz(br) - k + 1, sz(br)) cout << ' ' << br[i] - br[i - 1];
  57. }
  58.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement