Pagini recente » Cod sursa (job #1126481) | Cod sursa (job #2892690) | Cod sursa (job #1390262) | Rating Berengea Cristian (cristianberengea) | Cod sursa (job #1054170)
#include<fstream.h>
using namespace std;
ifstream f("segvente2.in");
ofstream g("segvente2.out");
long long int i,n,j,y,v[100],u[100],max,k,s,t,q[100],w[100],m;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
y=0;
for(j=1;j<=n;j++)
{
s=v[j];t=1;y++;
for(i=j;i<=n-1;i++)
{
if(v[i]+v[i+1]>0)
{s=s+v[i+1];t++;}
else
{if(t>=k)
{u[y]=s;
w[y]=i-t+1;
q[y]=i;}
i=n;}
}
}
max=u[1];
for(i=2;i<=y;i++)
if(max<=u[i])
{max=u[i];
m=i;}
g<<w[m]<<' '<<q[m]<<' '<<max;}