Cod sursa(job #2840386)
Utilizator | Data | 27 ianuarie 2022 17:48:05 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int s[1009];
int main()
{
int n,k,c=0,ma=-999,i,a[1009],co,pos1,pos2,pos11;
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(co=k;co<=n;co++)
{
for(i=1;i<=n;i++)
{
c++;
if(c<=co)
{
if(c==1) pos1=i;
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;
pos11=pos1;
}
i=i-co+1;
}
}
}
g<<pos11<<" "<<pos2<<" "<<ma;
}