Cod sursa(job #247497)
Utilizator | Sergiu-Ioan Ungur ssergiuss | Data | 23 ianuarie 2009 09:29:09 |
---|---|---|---|
Problema | Secventa 2 | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<algorithm>
using namespace std;
int n,k,a[50001];
void solve(){
int i,j,st,dr,max=0;
scanf("%d%d",&n,&k);
for(i=1; i<=n; ++i){
scanf("%d",&a[i]);
a[i]+=a[i-1];}
for(i=0; i+k<n+2; ++i)
for(j=i+k; j<=n; ++j)
if(a[j]-a[i]>=max){
max=a[j]-a[i];
st=i;
dr=j;}
printf("%d %d %d",st+1,dr,max);}
int main(){
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
solve();
return 0;}