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