Cod sursa(job #2365451)
| Utilizator | Data | 4 martie 2019 13:50:14 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int s[50005],n;
FILE *f,*g;
int main()
{
int v,mx,i,j,a,k,p1,p2;
f=fopen("secv2.in","r");
g=fopen("secv2.out","w+");
fscanf(f,"%d %d",&n,&k);
for (i=1;i<=n;i++)
{
fscanf(f,"%d",&v);
s[i]=s[i-1]+v;
}
mx=s[k]; p1=1; p2=k;
for (i=1;i<=n;i++)
for (j=i+k-1;j<=n;j++)
{
a=s[j]-s[i-1];
if (a>mx) { mx=a; p1=i; p2=j; }
}
fprintf(g,"%d %d %d\n",p1,p2,mx);
return 0;
}
