Cod sursa(job #1575644)
| Utilizator | Data | 21 ianuarie 2016 18:11:06 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,st,dr,maxim,a,start,sc,s[50005],v[50005];
int main()
{
fin>>n>>k;
for ( int i=1 ; i<=k ; i++ ){
fin>>v[i];
s[i]=s[i-1]+v[i];
}
sc = s[k];
start=st=1;
dr=k;
for ( int i=k+1 ; i<=n ; i++ ){
fin>>v[i];
s[i]=s[i-1]+v[i];
if ( s[i]-s[i-k] > sc+v[i] ){
start=i-k+1;
sc=s[i]-s[i-k];
}
else
sc+=v[i];
if ( sc > maxim ){
st=start;
dr=i;
maxim=sc;
}
}
fout<<st<<' '<<dr<<' '<<maxim;
}
