Cod sursa(job #976370)
Utilizator | Data | 23 iulie 2013 07:11:57 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long s,s1,t,n,i,j,k,p,poz1,poz2;
int a[50001];
int main()
{
fin>>n>>k;
for(i=1;i<=k;i++)
{
fin>>a[i];
s=s+a[i];
}
for(i=k+1;i<=n;i++)
fin>>a[i];
s1=s; p=k; t=s,poz1=1,poz2=k;
while(k<=n)
{
s=s1;
if(s>t) t=s,poz2=1,poz1=n;
for(j=k+1;j<=n;j++)
{
s=s+a[j]-a[j-k];
if(s>t) t=s,poz2=j,poz1=j-k+1;
}
s1=s1+a[k+1];
k++;
}
fout<<poz1<<' '<<poz2<<' '<<t;
return 0;
}