Pagini recente » Cod sursa (job #109781) | Borderou de evaluare (job #990147) | Cod sursa (job #465218) | Cod sursa (job #3206120) | Cod sursa (job #531629)
Cod sursa(job #531629)
#include <stdio.h>
using namespace std;
int n,k,A[50001],S[50001];
int mi,pmi,ma,pma,x;
FILE *f,*g;
void cit_sume()
{
fscanf(f,"%d %d",&n,&k);
for (int i=1;i<=n;++i)
{
fscanf(f,"%d",&A[i]);
S[i]=S[i-1]+A[i];
}
}
void rezolva()
{
S[0]=0;
mi=1000000;
ma=-1000000;
for (int i=1;i<=n;++i)
{
if (S[i-k]<mi && i-k>=0)
{
mi=S[i-k];
pmi=i-k;
}
x=S[i]-mi;
if (x>ma)
{
ma=x;
pma=i;
}
}
fprintf(g,"%d %d %d",pmi+1,pma,ma);
}
int main()
{
f=fopen("secv2.in","r");
g=fopen("secv2.out","w");
cit_sume();
rezolva();
fclose(f);
fclose(g);
return 0;
}