Pagini recente » Cod sursa (job #456053) | Cod sursa (job #201696) | Cod sursa (job #1277355) | Cod sursa (job #3168364) | Cod sursa (job #1954891)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
int n,numar[50000],inc=1,fin,beg,k;
long long suma=0,smax=-1000000000000;
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>numar[i];
if(suma<0)
suma=numar[i],inc=i;
else
suma+=numar[i];
if(suma>=smax)smax=suma,fin=i,beg=inc;
}
while(fin-beg+1<k)
{
suma=0,smax=-1000000000000;
inc=beg;
for(int i=beg+1;i<=n;i++)
{
if(suma<0)
suma=numar[i],inc=i;
else
suma+=numar[i];
if(suma>=smax)smax=suma,fin=i,beg=inc;
}
}
g<<smax<<" "<<beg<<" "<<fin;
}