Pagini recente » Cod sursa (job #1877708) | Cod sursa (job #216873) | Cod sursa (job #276038) | fmi-no-stress-9-warmup/solutii | Cod sursa (job #1029198)
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int S[60000], V[50000];
int min(int a, int b)
{
if(a>b)
return b;
else
return a;
}
int main()
{
int n,k,i,Smin,Su,dr,st;
in>>n>>k;
for(i=1; i<=n; i++)
in>>V[i];
S[0]=0;
Smin=25000;
Su=-25000;
for(i=1; i<=n; i++)
S[i]=S[i-1]+V[i];
for(i=k; i<=n; i++)
{
Smin=min(Smin, S[i-k]);
if(S[i]-Smin>Su)
{
Su=S[i]-Smin;
dr=i;
for(st=1; st<=n; st++)
if(Smin==S[st]) break;
}
}
out<<st+1<<" "<<dr<<" "<<Su;
}