Cod sursa(job #673950)
Utilizator | Data | 5 februarie 2012 12:07:49 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
int main()
{
int pozitia,n,i,j,k,sum,s;
long a[50005],maximul=0,Start,Finish;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<k;i++)
sum+=a[i];
pozitia=1;
for(i=k;i<=n;i++)
{
s+=a[i-k];
sum+=a[i];
if (s<0)
{
sum=sum-s;
s=0;
pozitia=i-k+1;
}
if(sum>maximul)
{
maximul=sum;
Start=pozitia;
Finish=i;
}
}
g<<Start<<" "<<Finish<<" "<<maximul;
return 0;
}