Cod sursa(job #1784572)
| Utilizator | Data | 20 octombrie 2016 11:13:01 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <iostream>
#include<fstream>
using namespace std;
long long i,j,s[50001],mx=-2000000000,k,x,n,m,im,jm,S;
int main()
{
ifstream f("secv2.in");f>>n>>k;
for(i=1;i<=n;++i){f>>x;s[i]=s[i-1]+x;}
f.close();m=n-k+2;
for(i=1;i<m;++i)
{
for(j=i+k-1;j<=n;++j)
{
S=s[j]-s[i-1];
if(mx<S)
{
mx=S;
im=i;
jm=j;
}
}
}
ofstream g("secv2.out");
g<<im<<" "<<jm<<" "<<mx;
g.close();
return 0;
}
