Cod sursa(job #871738)
Utilizator | Data | 5 februarie 2013 09:48:19 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int S[50005], n;
int bestSum = -2000000000, min = 2000000000, idx, beg, end, i, k;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{cin>>S[i];
S[i]=S[i]+S[i-1];}
for(i=k;i<=n;i++){
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;
} }
cout << beg << " " << end<<" "<<bestSum <<"\n";
return 0;
}