Cod sursa(job #2129195)
| Utilizator | Data | 12 februarie 2018 16:48:39 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int s[50001],i,n,Max=-1250000001,inc,sf,ant,k;
int main()
{
fin>>n>>k;
for (i=1;i<=n;i++)
{fin>>s[i];
s[i]+=s[i-1];
}
for (i=k;i<=n;i++)
{
if (s[ant]>s[i-k])
ant=i-k;
if (s[i]-s[ant]>Max)
Max=s[i]-s[ant],inc=ant+1,sf=i;
}
fout<<inc<<" "<<sf<<" "<<Max;
return 0;
}
