Pagini recente » Cod sursa (job #1093397) | Istoria paginii runda/simulare_oji_ichc_12_03 | Arhiva de probleme | Cod sursa (job #382084) | Cod sursa (job #696885)
Cod sursa(job #696885)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long i, n, k, a[60000], s[60000], smin=2000000000, smax=-2000000000, pmin, pmax;
int main()
{
f>>n>>k;
for(i=1; i<=n; ++i)
{
f>>a[i];
s[i]=s[i-1]+a[i];
}
for(i=k; i<=n; ++i)
{
if(s[i-k]<smin)
{
smin=s[i-k];
pmin=i-k;
}
if(s[i]-smin>smax)
{
smax=s[i]-smin;
pmax=i;
}
}
g<<pmin+1<<" "<<pmax<<" "<<smax<<"\n";
}