Cod sursa(job #1375243)
Utilizator | Mihai Perju mihaiperju | Data | 5 martie 2015 12:46:01 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,a[6000001],smax,poz,pozf,k;
void read()
{
int i;
fin>>n>>k;
for(i=1; i<=n; i++)
fin>>a[i];
}
void solve()
{
int i=1, j=2,s=0;
smax=s=a[1];
poz=1;
for(j=2;j<=n;j++)
{
s+=a[j];
if(s>smax&&j-poz>=k)
{
smax=s;
pozf=j;
}
if(s<0)
{
s=a[++j];
poz=j;
}
}
}
void write()
{
fout<<poz<<" "<<pozf<<" "<<smax<<endl;
}
int main()
{
read();
solve();
write();
return 0;
}