Pagini recente » Cod sursa (job #2357373) | Cod sursa (job #2607736) | Cod sursa (job #737080) | Cod sursa (job #403559) | Cod sursa (job #2535374)
#include <iostream>
#include <fstream>
#define nmax 30005
using namespace std;
int sum[nmax], n, v[nmax];
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int i, j;
fin>>n;
for(i = 1; i<=n; i++)
fin>>v[i];
int maxi = v[1], inf = 1, sup = 1;
sum[1] = v[1];
for(i = 2; i<=n; i++)
{
sum[i] = sum[i-1] + v[i];
if(maxi<sum[i])
maxi = sum[i];
}
for(i = n; i>1; i--)
{
for(j = i-1; j>=1; j--)
{
if(maxi< sum[i] - sum[j])
{
maxi = sum[i] - sum[j];
inf = j+1;
sup = i;
}
}
}
fout<<maxi<<" "<<inf<<" "<<sup;
return 0;
}