Pagini recente » Cod sursa (job #2608079) | Cod sursa (job #2045637) | Cod sursa (job #1603893) | Cod sursa (job #2694844) | Cod sursa (job #2175909)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long long n,j,i,smax,min1,p,a,u,k;
int x[50001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++) f>>x[i];
smax=-125000000; min1=125000000; a=1;
for(i=1;i<=n;i++){
x[i]=x[i]+x[i-1];
if(smax<x[i]-min1&&(i-a+2>=k)) { smax=x[i]-min1; p=a+1; u=i; }
if(min1>x[i]) { min1=x[i]; a=i; }
// g<<smax<<' '<<min1<<'\n';
}
if(k==n) g<<1<<' '<<n<<' '<<x[i];
else
g<<p<<' '<<u<<' '<<smax<<'\n';
return 0;
}