Pagini recente » Diferente pentru utilizator/tex intre reviziile 2 si 1 | Autentificare | Profil dia0369 | Summer Challenge Unu | Cod sursa (job #1604118)
//Subsecventa de suma maxima
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, v[6000000], s[6000000], a, b;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
a=max_element(s+1, s+n+1)-s;
b=min_element(s+1, s+a)-s;
fout<<s[a]-s[b]<<' '<<b+1<<' '<<a;
fin.close();
fout.close();
return 0;
}