Cod sursa(job #9888)
| Utilizator | Data | 27 ianuarie 2007 18:49:48 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream.h>
int main()
{ifstream f("secv2.in");
ofstream g("secv2.out");
int n,i,j,max,s[100],c[100],d[100],e,a[100],k,x=0,b[100];
f>>n>>k;
for (i=1;i<=n;i++)
f>>a[i];
s[1]=a[1];
for(i=2;i<=n;i++)
s[i]=s[i-1]+a[i];
for(i=k;i<=n;i++)
for(j=1;j<n-k+1;j++)
{b[++x]=s[j+i]-s[j];
c[x]=j+i;
d[x]=j+1;}
max=-30000;
for(i=1;i<=x;i++)
if(b[i]>max) {max=b[i];e=i;}
g<<d[e]<<" "<<c[e]<<" "<<max;}