Cod sursa(job #3309797)
| Utilizator | Data | 9 septembrie 2025 08:10:14 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream F("transport.in");
ofstream G("transport.out");
int n,k,a[16000],i,b,c,s,t,l,r,j;
int main()
{
for(F>>n>>k;i<n;F>>a[i],b=max(b,a[i]),c+=a[i++]);
for(s=1;s<=c-b;s<<=1);
for(j=c,t=s;t;l<=k&&j>=t+b?j-=t:0,t>>=1)
for(l=1,r=0,i=0;i<n;r+=a[i],r>j-t?r=a[i],++l:0,++i);
return G<<j,0;
}
