Pagini recente » Cod sursa (job #1920565) | Cod sursa (job #1104865) | Monitorul de evaluare | Cod sursa (job #1333940) | Cod sursa (job #952674)
Cod sursa(job #952674)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int start,final,x,s,i,n,k,v[50010];
long long sol;
int main()
{
in>>n>>k;
for(i=1;i<=n;i++){
in>>x;
v[i]=v[i-1]+x;
}
for(i=1;i<=n;i++)
{
if(v[i]<s){
s=v[i];
start=i;
}
if (v[i]-s>sol && i-start>k){
sol=v[i]-s;
final=i;
}
}
if (n==k)
out<<1<<' '<<n<<' '<<v[n]<<'\n';
else
out<<start+1<<' '<<final<<' '<<sol<<'\n';
in.close();
out.close();
return 0;
}