Cod sursa(job #470255)
| Utilizator | Data | 12 iulie 2010 16:16:40 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
#include <limits.h>
using namespace std;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,ci,smax=-250001,sir[50050],in=0,sf=0,s=0,index=0;
f>>n>>k;
for(i=1; i<=n; i++){
f>>sir[i];
}
for(i=1; i<=n; i++) {
sir[i]+=sir[i-1];
if (smax<sir[i]-s && i-index>=k){
smax=sir[i]-s;
in=index+1;
sf=i;
}
if (s>sir[i] && n-index-1>k){
s=sir[i];
index=i;
}
}
g<<in<<" "<<sf<<" "<<smax ;
f.close();
g.close();
return 0;
}
