Cod sursa(job #1166840)
Utilizator | Bogdan Ciobanu bciobanu | Data | 3 aprilie 2014 20:57:48 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int main()
{
fstream f("secv2.in",ios::in),g("secv2.out",ios::out);
int n,i,k,a[50005],V[50005]={},i1,i2,sum,v,s;
f>>n>>k;
for(i=1;i<=n;++i)
{
f>>a[i];
V[i]=V[i-1]+a[i];
}
f.close();
sum=v=V[k];
i1=s=1;
i2=k;
for(i=k+1;i<=n;++i)
{
v+=a[i];
if(v<V[i]-V[i-k])
{
v=V[i]-V[i-k];
s=i-k+1;
}
if(v>sum)
{
sum=v;
i1=s;
i2=i;
}
}
g<<i1<<" "<<i2<<" "<<sum;
g.close();
return 0;
}