Cod sursa(job #1141446)
Utilizator | Data | 12 martie 2014 21:25:35 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k, v[50001];
int main()
{
f>>n>>k;
int s=0,beg=1,end=k,ind,smax,i,x;
for(i=1;i<=k;i++){
f>>v[i];
s+=v[i];
}
smax=s;
for(i=k+1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++){
if(s<0){
s=0;
ind=i;
}
s+=v[i];
if(s>smax && i-ind+1>=k){
smax=s;
beg=ind;
end=i;
}
}
g<<beg<<" "<<end<<" "<<smax<<"\n";
return 0;
}