Cod sursa(job #2320306)
Utilizator | Data | 14 ianuarie 2019 17:03:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
std::ifstream f("secv2.in");
std::ofstream g("secv2.out");
long long s=0,maxx=-2147483647;
int n,k,v[50005],i,nr,startc,start,stop;
int main()
{
f>>n>>k;
for(i=0;i<n;i++)
{
f>>nr;
s+=nr;
if(s<0)
{
s=0;
startc=i;
}
if(s>maxx)
{
maxx=s;
start=startc;
stop=i;
}
}
if(stop+1-start+2>=k)
g<<start+2<<" "<<stop+1<<" "<<maxx;
else
g<<0;
f.close();
g.close();
return 0;
}