Cod sursa(job #1343745)
Utilizator | Data | 15 februarie 2015 21:04:44 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
#include<algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
int i,n,k,rs,m,aux,gmb,fnc,a[50005];
int main()
{
ifstream cin("secv2.in");
ofstream cout("secv2.out");
cin>>n>>k;
for(i=1;i<=n;++i) cin>>gmb,a[i]=a[i-1]+gmb;
rs=-INF; aux=fnc=1; gmb=k;
for(i=k;i<=n;++i)
{
if(a[i]-m>rs) rs=a[i]-m,gmb=i,fnc=aux;
if(a[i-k+1]<m) m=a[i-k+1],aux=i-k+2;
}
cout<<fnc<<' '<<gmb<<' '<<rs<<'\n';
return 0;
}