Cod sursa(job #1576405)
| Utilizator | Data | 22 ianuarie 2016 13:47:08 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long i,j,n,k,mx=0,x,y,z,v[5000000],s;
int main()
{
ifstream f ("secv2.in");
ofstream g ("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
x=k;j=0;
while(x<=n)
{
s=0;
j++;
for(i=j;i<=j+x;i++)
s=s+v[i];
if(s>mx){mx=s;y=j;z=j+x;}
if(j==n){j=1;x++;}
}
g<<y<<" "<<z<<" "<<mx;
return 0;
}
