Cod sursa(job #11209)
| Utilizator | Data | 30 ianuarie 2007 21:08:34 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream.h>
int main()
{ifstream f("secv22.in");
ofstream g("secv2.out");
int n,i,j,max,s[5000],c[5000],d[5000],e,a[5000],k,x=0,b[5000];
f>>n>>k;
for (i=1;i<=n;i++)
f>>a[i];
s[1]=a[1]; s[0]=0;
for(i=2;i<=n;i++)
s[i]=s[i-1]+a[i];
for(i=k;i<=n;i++)
for(j=1;j<=n-i+1;j++)
{b[++x]=s[j+i-1]-s[j-1];
c[x]=j+i-1;
d[x]=j;}
max=-26000;
for(i=1;i<=x;i++)
if(b[i]>max) {max=b[i];e=i;}
g<<d[e]<<" "<<c[e]<<" "<<max;
return 0;}