Cod sursa(job #957278)
Utilizator | Antonesi Florean Costin costin7856 | Data | 4 iunie 2013 18:58:07 |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include<fstream>
#define dim 50009
using namespace std;
int a[dim],sum[dim],n,k,st,dr,in,s,max1;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>a[i];
sum[i]=a[i]+sum[i-1];
}
max1=a[1];
max1=sum[k]=s;
st=in=1;
dr=k;
for(int i=k+1;i<=n;i++)
{
if(sum[i]-sum[i-k]>=a[i]+s)
{
s=sum[i]-sum[i-k];
st=i-k+1;
}
else
s+=a[i];
if(s>max1)
{
dr=i;
max1=s;
in=st;
}
}
g<<in<<" "<<dr<<" "<<max1;
}