Cod sursa(job #1902030)
Utilizator | Data | 4 martie 2017 12:52:33 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,el,m=-9999999,a[50001],z,d,p;
int main()
{f>>n>>k;
for(i=1;i<=n;i++)f>>a[i],a[i]+=a[i-1];
for(i=k;i<=n;i++)
{if(a[p]>a[i-k]) p=i-k;if(a[i]-a[p]>m) m=a[i]-a[p],z=p+1,d=i;}
g<<z<<" "<<d<<" "<<m;
return 0;
}