Cod sursa(job #3360468)
| Utilizator | Data | 14 iulie 2026 12:18:55 | |
|---|---|---|---|
| Problema | Transport | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16000];
int drumuri(int v[],int n,int x){
int i=0, s=0, drum=1;
for(i=0;i<n;i++){
s+=v[i];
if(s+v[i+1]>x){
s=0;
drum++;
}
}
return drum;
}
int main()
{
int x, n, i, st, dr, mij;
in>>n>>x;
for(i=0;i<n;i++){
in>>v[i];
}
st=1;
dr=n+5;
while(st<dr-1){
mij=(st+dr)/2;
if(drumuri(v,n,mij)>x){
st=mij;
}else{
dr=mij;
}
}
out<<dr;
return 0;
}
