Pagini recente » Cod sursa (job #1840627) | Cod sursa (job #677644) | Cod sursa (job #520226) | Cod sursa (job #316530) | Cod sursa (job #2225597)
#include <bits/stdc++.h>
#define Dim 100006
using namespace std;
ifstream f("grupuri.in");
ofstream g("grupuri.out");
long N,K,A[Dim],Dist[Dim];
long cnt,S,lim;
bool stop=1;
int main()
{
f>>K>>N; Dist[0]=1;
for(int i=1;i<=N;i++)
{
f>>A[i];
if(i<=N-K) S+=A[i];
else
{
if(stop) cnt+=A[i];
if(stop==0&&(A[i]-A[i-1])*Dist[lim]<=S&&A[i]-A[i-1]!=0)
{
cnt++;
S-=(A[i]-A[i-1])*Dist[lim];
lim++;
Dist[lim]=Dist[lim-1]+1;
}
cout<<cnt<<" "<<lim<<" "<<i<<" "<<Dist[lim]<<" "<<S<<'\n';
stop=0;
}
}
cnt+=S/K;
g<<cnt;
return 0;
}