Cod sursa(job #272177)
| Utilizator | Data | 6 martie 2009 15:33:37 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<fstream>
using namespace std;
int v[16010],s,d,m,i,n,rez,k,S;
int verific(int x)
{ int i,sum=0,t=1;
for(i=1;i<=n;i++)
if(sum+v[i]>x) {sum=0; t++; i--;
if(t>k) return 0;
}
else sum+=v[i];
return 1;
}
int main()
{
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1;i<=n;i++) { f>>v[i]; S+=v[i];}
s=1; d=S;
while(s<=d)
{ m=(s+d)>>1;
if(verific(m)) {rez=m; d=m-1;}
else s=m+1;
}
g<<rez;
f.close();
g.close();
return 0;
}
