Cod sursa(job #871730)

Utilizator CosminRusuCosmin Rusu CosminRusu Data 5 februarie 2013 09:40:14
Problema Secventa 2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.56 kb
#include<fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int a[50005], S[50005], n;
int main()
{
 int bestSum = -int(2e9), min = 0, idx, beg, end, i, k;
 cin>>n>>k;
 for(i=1;i<=n;i++)
     cin>>S[i];
 for(i=k;i<=n;i++){
     S[i]=S[i]+S[i-1];
     if (bestSum < S[i] - min)
        bestSum = S[i] - min, beg = idx, end = i;
     if (min > S[i-k])
        min = S[i-k], idx = i-k+1;
                            } 
//if(end-beg+1>=k)
cout <<  beg << " " << end<<" "<<bestSum <<"\n";
//else cout<<"0 0 0\n";
    return 0;
}