Cod sursa(job #2158519)
Utilizator | Andrei George Arcadego999 | Data | 10 martie 2018 13:40:04 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int main()
{
long long maxx=-1250000000,s=0,st=0,n,k,nr,i,p,u,ii=1;
in>>n>>k;
for (i=1;i<=n;i++)
{
in>>nr;
if (s<0)
{
s=0;
ii=i;
}
s+=nr;
st+=nr;
if (i-ii+1>=k && s>maxx)
{
maxx=s;
p=ii;
u=i;
}
}
if (k==n)
{
out<<1<<' '<<n<<' '<<st;
}
else
{
out<<p<<' '<<u<<' '<<maxx;
}
return 0;
}