Cod sursa(job #1188979)
| Utilizator | Data | 21 mai 2014 00:00:41 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.89 kb |
#include<fstream>
using namespace std;
ifstream fi("secv2.in");
ofstream fo("secv2.out");
const int maxn = 50004;
int st,dr,sol,suma,minim;
int i,k,n,x,s[maxn];
int main(){
fi>>n>>k;
for(i=1;i<=n;i++){ fi>>x; s[i]=s[i-1]+x; }
sol=s[k];
st=1;
dr=k;
minim=0;
for(i=k+1;i<=n;i++){
if(s[i-k]<minim){
minim=s[i-k];
st=i-k+1;
}
suma=s[i]-minim;
if(suma>sol){
sol=suma;
dr=i;
}
}
fo<<st<<" "<<dr<<" "<<sol;
fi.close();
fo.close();
return 0;
}
