Pagini recente » Cod sursa (job #933982) | Cod sursa (job #956357) | Cod sursa (job #1954527) | Cod sursa (job #824560) | Cod sursa (job #2712893)
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
long long n,i,v[50002],maxi,s,d,k,j,z,sp[50002];
int main()
{
fin>>n>>k;
for (i=1;i<=n;i++)
{
fin>>v[i];
sp[i]=v[i]+sp[i-1];
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n-i;j++)
for (z=j+i;z<=n;z++)
{
if (maxi<sp[z]-sp[j-1])
{
maxi=sp[z]-sp[j-1];
s=j;
d=z;
}
}
}
fout<<maxi<<" "<<s+1<<" "<<d+1;
return 0;
}