Cod sursa(job #1154609)
| Utilizator | Data | 26 martie 2014 11:45:20 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.77 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long n,k,maxim,sum,in,sav,sav2,i,j,v[50001];
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
f>>v[i];
i=1;
sum=-1;
while (i<=n)
{
if (sum<0)
{
in=i;
sum=0;
for (j=0;j<k;j++)
sum=sum+v[i+j];
i=i+k-1;
}
while (sum>=0 && i<=n)
{
if (sum>maxim)
{
maxim=sum;
sav=in;
sav2=i;
}
i++;
sum=sum+v[i];
}
if (i<n)
i=i-k+2;
}
g<<sav<<' '<<sav2<<' '<<maxim;
f.close();
g.close();
return 0;
}
