Cod sursa(job #930525)
| Utilizator | Data | 27 martie 2013 18:11:35 | |
|---|---|---|---|
| Problema | Rj | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.87 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,t,inc,sf;
long long s[50001],maxim;
int a[50001];
int main()
{
f>>n;
f>>k;
for(i=1;i<=n;++i) {
f>>a[i];
s[i]=s[i-1]+a[i];
}
maxim=-9999999;
for(i=1;i<=n-k+1;++i)
{
for(t=0;t+i+k-1<=n;++t) {
if(s[i+t+k-1]-s[i-1]>maxim) {
maxim=s[i+t+k-1]-s[i-1];
inc=i;
sf=i+t+k-1;
}
}
}
g<<inc<<" "<<sf<<" "<<maxim;
return 0;
}
