Cod sursa(job #89999)
Utilizator | Chelariu Alexandru alexch16 | Data | 8 octombrie 2007 10:31:41 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream.h>
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long main()
{
long a[20], i, k, n, max, nr, s, in, sf;
max = -32000;
fin>>n;
fin>>k;
for (i=1; i<=n; i++)
fin>>a[i];
while (k<=n)
{
for (i=1; i<=n-k+1; i++)
{
s = 0;
nr = 0;
while (nr<k)
{
s = s+a[i+nr];
nr++;
}
if (s > max)
{
max = s;
in = i;
sf = in+k-1;
}
}
k++;
}
fout<<in<<" "<<sf<<" "<<max<<endl;
return 0;
}