Cod sursa(job #2511929)
Utilizator | Data | 20 decembrie 2019 10:56:00 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int N=50001;
int v[N],n,k,s,smax=-25000*50000,st,dr,a[N];
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
a[i]=v[i]+a[i-1];
}
for(int i=1;i<=n-k+1;i++)
{
for(int j=i+k-1;j<=n;j++)
{
s=a[j]-a[i-1];
if(s>smax)
{
smax=s;
st=i;
dr=j;
}
}
}
fout<<st<<" "<<dr<<" "<<smax;
return 0;
}