Cod sursa(job #2712749)
| Utilizator | Data | 26 februarie 2021 14:38:27 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.8 kb |
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int n,k,i,v[50002],stm,drm,st,l=0,p;
long long s,m,maxi;
int main()
{
fin>>n>>k;
for(i=1; i<=n; i++)
fin>>v[i];
p=k;
while(k<n)
{st=1;
for(i=1; i<=n-k+1; i++)
{
s=s+v[i];
l++;
if(l==1)st=i;
if(s>maxi && l>=p)
{
maxi=s;
stm=st;
drm=i;
m=s;
s=0;
}
if(l==k)
{
l=0;
s=0;
i=st;
st=i;
}
}
k++;
s=0;
l=0;
}
fout<<stm<<" "<<drm<<" "<<m;
return 0;
}
