Pagini recente » Cod sursa (job #1504309) | Cod sursa (job #1588554) | Cod sursa (job #858660) | Cod sursa (job #1441) | Cod sursa (job #1830805)
#include <iostream>
#include<fstream>
#include<deque>
using namespace std;
int v[50001],i,k,x,n,s,ls,ld,mx=-(1<<29);
deque<int>d;
int main()
{
ifstream f("secv2.in");
f>>n>>k>>v[1];++n;
s=v[1];
if(k==1)
{
ls=1;ld=1;mx=v[1];
}
d.push_front(1);
for(i=2;i<n;++i)
{
f>>v[i];s+=v[i];
d.push_front(i);
while( d.back() < i-k+1 && v[ d.back() ] < 1 )
{
s -=v[ d.back() ];
d.pop_back();
}
if( s>mx && d.front() > k-1 )
{
mx=s;
ls=d.back();
ld=d.front();
}
}
ofstream g("secv2.out");
g<<ls<<" "<<ld<<" "<<mx;
return 0;
}