Pagini recente » Cod sursa (job #2494952) | Profil Serban2331 | Monitorul de evaluare | Cod sursa (job #1670414) | Cod sursa (job #1497802)
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
long long a[6000007], s , i, j, n, maxim , l , k , lmax, kmax, o;
int main()
{
n=7;
a[1]=5;
a[2]=-6;
a[3]=3;
a[4]=4;
a[5]=-2;
a[6]=3;
a[7]=-3;
// for (i = 1; i <= n; i++)
// fi >> a[i];
for (i = 1; i <= n; i++)
{ s+=a[i];
if (s < 0)
{
s = 0;
l = i; k = i;lmax=i+1; }
else
{
if ( maxim < s) {maxim = s;kmax=i;}
}
}
fo << maxim << " " << lmax << " " << kmax;
return 0;
}