Cod sursa(job #1699721)
| Utilizator | Data | 8 mai 2016 13:40:28 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,a[50010],b[50010],sum,inc,incmax,sfmax,sumax=0,sumi=0;
int main()
{
fin>>n>>k;
for (int i=1;i<=n;i++)
{
fin>>a[i];
sumi=sumi+a[i];
if (b[i-1]+a[i]<=0)
{
b[i]=0;
inc=i+1;
}
else
b[i]=b[i-1]+a[i];
if (i-inc+1>=k && b[i]>sumax)
{
sumax=b[i];
incmax=inc;
sfmax=i;
}
}
if (n!=k)
{
if (incmax==0)
incmax++;
fout<<incmax<<' '<<sfmax<<' '<<sumax;
}
else
{
fout<<1<<' '<<n<<' '<<sumi;
}
return 0;
}
