Pagini recente » Cod sursa (job #1641408) | Cod sursa (job #3278275) | Borderou de evaluare (job #2499765) | Cod sursa (job #575822) | Cod sursa (job #585393)
Cod sursa(job #585393)
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int MAXN=7000005;
int v[MAXN],n,i,j,k,sum=-int(2e9),S,st,dr;
int main()
{
f>>n;
for (i=1; i<=n; ++i)
f>>v[i];
f.close();
for (i=1; i<=n; ++i)
{
for (j=n; j>=1; --j)
{
sum = 0;
for (k=i; k<=j; ++k)
sum += v[k];
if (sum > S)
{
S = sum;
st = i;
dr = j;
}
}
}
g<<S<<" "<<st<<" "<<dr<<'\n';
return 0;
}