Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- long long n,m,wynik,zly,dobry,czas,L,P,S,b;
- long long t[1000006],maszyny;
- int main()
- {
- ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
- cin>>n>>m;
- for(int i = 1; i <= n; i++)
- {
- cin>>t[i];
- dobry = max(dobry,t[i]);
- zly += t[i];
- }
- L = dobry;
- P = zly;
- while(L != P)
- {
- czas = 0;
- S = (L+P) / 2;
- b = S;
- for(int j = 1; j <= n; j++)
- {
- czas = max(maszyny,czas);
- if(maszyny < S)
- {
- maszyny += t[j];
- }
- else
- {
- maszyny = 0;
- maszyny += t[j];
- }
- }
- //cout<<czas<<maszyny<<endl;
- if(czas > S)
- L = S+1;
- else
- P = S;
- }
- cout<<L;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement