Cod sursa(job #1863692)
Utilizator | Data | 31 ianuarie 2017 09:30:50 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
int n, k, c=1, maxS=-2000000, S=0, p, maxI, maxJ;
f>>n>>p;
for(int i=1; i<=n; i++)
{
f>>k;
S+=k;
if(S>maxS)
{
if(i-c+1>p)
{
maxS=S;
maxI=i;
maxJ=c;
}
}
if(S<0)
{
S=0;
c+=1;
}
}
g<<maxJ+1<<" "<<maxI<<" "<<maxS;
return 0;
}