Cod sursa(job #1574101)
| Utilizator | Data | 20 ianuarie 2016 09:49:09 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <stdio.h>
#include <climits>
using namespace std;
FILE *f,*g;
int s[50002];
int main()
{
f=fopen("secv2.in","r");
g=fopen("secv2.out","w");
int n,k,i,nr,in,sf,max,j;
fscanf(f,"%d %d",&n,&k);
for (i=1; i<=n; i++)
{
fscanf(f,"%d",&nr);
s[i]=s[i-1]+nr;
}
in=0;
sf=0;
max=INT_MIN;
for (i=1; i<=n; i++)
{
for (j=i+k-1; j<=n; j++)
{
if (s[j]-s[i-1]>max)
{
max=s[j]-s[i-1];
in=i;
sf=j;
}
}
}
//for (i=1; i<=n; i++)
// fprintf(g,"%d ",s[i]);
fprintf(g,"%d %d %d",in,sf,max);
fclose(f);
fclose(g);
}
