Pagini recente » Cod sursa (job #3158567) | Cod sursa (job #2775303) | Cod sursa (job #2305848) | Cod sursa (job #1728077) | Cod sursa (job #264039)
Cod sursa(job #264039)
#include<fstream>
using namespace std;
int v[100010],i,n,k,s,m,d;
unsigned long long S,sum;
int main()
{
ifstream f("grupuri.in");
ofstream g("grupuri.out");
f>>k>>n;
for(i=1;i<=n;i++) {f>>v[i]; S+=v[i];}
d=S/k; s=1;
while(s<=d)
{ m=(s+d)>>1;
S=0; sum=k*m; i=1;
while(S<sum&&i<=n)
{
if(i<=m) S+=v[i];
else S+=m;
i++;
}
if(i<=n||i>n&&S>=sum) s=m+1;
else d=m-1;
}
g<<m;
f.close();
g.close();
return 0;
}