Cod sursa(job #643554)
Utilizator | Data | 3 decembrie 2011 21:17:32 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,m,c,secv[50005];
int mx,st,sf;
int main() {
f>>n>>k;
for (i=1;i<=n;i++) {
f>>m;
secv[i]=secv[i-1]+m;
}
for (i=1;i<=n-k;i++) for (j=i+k;j<=n;j++) {
if (secv[j]-secv[i]>mx) {
mx=secv[j]-secv[i];
st=i+1;
sf=j;
}
}
g<<st<<' '<<sf<<' '<<mx;
return 0;
}