Cod sursa(job #2856890)
Utilizator | Data | 24 februarie 2022 15:36:37 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,v[50002],Smax=-1,S,lmax,l,pmax;
int main()
{
int i;
f >> n >> k;
for (i=1;i<=n;i++)
f >> v[i];
for (i=1;i<=n;i++)
{
S+=v[i];
l++;
if (S>=0)
{
if (S>Smax and l>=k)
{
Smax=S;
pmax=i;
lmax=l;
}
}
else
{
S=0;
l=0;
}
}
g << pmax-lmax+1 << " " << pmax << " " << Smax;
return 0;
}