Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- const ll M = 1000002;
- ll n,m;
- ll tab[M];
- ll pref[M];
- pair<ll,ll> para[M];
- vector<ll> wyn;
- ll wynik;
- int main()
- {
- cin >> n >> m;
- for(ll i=1; i<=n; i++)
- {
- cin >> tab[i];
- pref[i]=pref[i-1] + tab[i];
- para[i].first = pref[i];
- para[i].second = i;
- }
- sort(para, para+n);
- for(ll i=1; i<=n; i++)
- {
- for(ll j=1; para[j].first - para[i].first<=m; j++)
- {
- if(para[j].first - para[i].first == m) wyn.push_back(para[j].second - para[i].second);
- }
- }
- for(ll i=0; i<wyn.size(); i++)
- {
- wynik = max (wynik, wyn[i]);
- }
- if(wynik == 0) cout << "BRAK";
- else cout << wynik;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement