Cod sursa(job #1407124)
Utilizator | Data | 29 martie 2015 18:09:22 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
short v[6000005];
int main()
{
int n,s=0,maxs=-99999999,in,sf,con=0,k;
f>>n>>k;
for (int i=1;i<=n;i++)
{
f>>v[i];
}
if (n==k)
{
for (int i=1;i<=n;i++)
{
s=s+v[i];
}
g<<1<<" "<<k<<" "<<s;
return 0;
}
for (int i=1;i<=n;i++)
{
s=v[i]+s;
if(con>k)
if(s>maxs)
{
maxs=s;
sf=i;
in=sf-con;
}
con++;
if (s<0)
{
s=0;
con=0;
}
}
g<<in<<" "<<sf<<" "<<maxs;
return 0;
}