Cod sursa(job #1655118)
Utilizator | Data | 17 martie 2016 19:08:36 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int last, maxim, i, n, x, prim, ultim, primadev, k;
int main()
{
fin>>n>>k;
maxim=-100000000;
for (i=1; i<=n; i++)
{
fin>>x;
if (last>=0)
last+=x;
else
{
if (x>last)
{
last=x;
prim=i;
}
}
if (last>maxim && i-primadev+1>=k)
{
maxim=last;
primadev=prim;
ultim=i;
}
}
fout<<primadev<<" "<<ultim<<" "<<maxim;
return 0;
}