Cod sursa(job #152437)
Utilizator | Sandu Bogdan BooZZy | Data | 9 martie 2008 14:28:01 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream.h>
int max=0,i,j,h=0,s=0,ifin,jfin,n,k,v[50000];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)f>>v[i];
if(n==k) {for(i=1;i<=n;i++)s+=v[i];max=s;ifin=1;jfin=n;}
else for(i=1;i<=n;i++){s+=v[i];if(s>h&&i>=k){h=s;jfin=i;}}
for(i=jfin-1;i>0;i--){h+=v[i];if(h>max&&(jfin-i+1)>=k){max=h;ifin=i;}}
g<<ifin<<" "<<jfin<<" "<<max;
f.close();
g.close();
return 0;
}