Cod sursa(job #1955087)
Utilizator | Data | 5 aprilie 2017 19:56:20 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
short numere[50001],corect=false;
long long suma[50001],smax=-2000000000;
int n,k;
int beg,fin;
int inc=1;
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>numere[i],suma[i]=suma[i-1]+numere[i];
for(int i=k;i<=n;i++)
{
if(suma[inc]>suma[i-k])inc=i-k;
if(suma[i]-suma[inc]>smax)smax=suma[i]-suma[inc],beg=inc+1,fin=i;
}
g<<beg<<" "<<fin<<" "<<smax<<"\n";
f.close();
g.close();
return 0;
}