Cod sursa(job #2840552)
Utilizator | Data | 27 ianuarie 2022 23:41:18 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.28 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int s[100001],a[100001];
int main()
{
long long n,k,i,co,c=0,ma=-999999,pos11=0,pos1=0,pos2=0;
f>>n>>k;
for(i=1;i<=n;i++) f>>a[i];
for(co=k;co<=n;co++)
{
c=0;
for(i=1;i<=n;i++)
{
c++;
if(c==1) pos11=i;
if(c<=co)
{
if(i==1)s[i]=a[i];
else s[i]=s[i-1]+a[i];
s[i-1]=0;
}
else
{
c=0;
if(s[i-1]>=ma)
{
ma=s[i-1];
pos2=i-1;
pos1=pos11;
}
s[i-1]=0;
i=i-co;
}
if(i==n&&c!=0)
if(s[i]>ma)
{
ma=s[i];
pos2=i;
pos1=pos11;
}
}
}
g<<pos1<<" "<<pos2<<" "<<ma;
}