Pagini recente » Cod sursa (job #186327) | Cod sursa (job #1288267) | Cod sursa (job #1976450) | Cod sursa (job #3140229) | Cod sursa (job #2293470)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int a[60000],b[60000],i,n,xstart,yend,best,ibegin=1,iend=1;
void Citire(int a[],int n)
{
for(i=1;i<=n;i++)
fin>>a[i];
}
void SSM(int a[], int n, int b[], int k)
{
//int best;
best=a[1];
xstart=yend=1;
for(i=2;i<=n;i++)
{
b[i]=a[i];
if(b[i]<b[i-1]+a[i])
{
b[i]=b[i-1]+a[i];
yend=i;
}
else
{
xstart=i;
yend=i;
}
if(best<b[i])
{
//best=b[i];
// yend=i;
ibegin=xstart;
iend=yend;
if(iend-ibegin+1>=3)
best=b[i];
}
}
//return best;
}
int main()
{
int k;
fin>>n;
fin>>k;
Citire(a,n);
SSM(a,n,b,k);
fout<<ibegin<<" "<<iend<<" "<<best;
return 0;
}