Pagini recente » Cod sursa (job #269511) | Istoria paginii runda/becreative2/clasament | Istoria paginii runda/bun_simulareoji_2007_11-12 | Cod sursa (job #2823304) | Cod sursa (job #1402254)
#include <fstream>
#define LL long long int
using namespace std;
long long int sum[50001];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
LL i,n,k,poz1,fina1,a;
LL MAX=-(1LL<<60),mins=(1LL<<60),mind;
f>>n;
f>>k;
for(i=1;i<=n;i++)
{
f>>a;
sum[i]+=sum[i-1]+a;
}
for (i=k; i<=n; i++){
if (mins>sum[i-k])
{
mins=sum[i-k];
mind=i-k;
}
if (sum[i]-mins>MAX)
{
MAX=sum[i]-mins;
poz1=mind+1;
fina1=i;
}
}
g<<poz1<<" "<<fina1<<" "<<MAX;
f.close();
g.close();
return 0;
}