Cod sursa(job #957317)
| Utilizator | Data | 4 iunie 2013 20:23:16 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("secv2.in");
ofstream fo("secv2.out");
int j,i,n,k,a[50001],s[50001],m,st,fn;
int main()
{
fi >> n >> k;
for (i=1; i<=n; i++)
fi >> a[i],s[i]=s[i-1]+a[i];
for (i=0; i<=n-k; i++)
for (j=i+k; j<=n; j++)
{
int sum=s[j]-s[i];
if (sum>m)
{
m=sum;
st=i+1;
fn=j;
}
}
fo << st << ' ' << fn << ' ' << m;
return 0;
}
