Pagini recente » Cod sursa (job #325032) | Cod sursa (job #62691) | Cod sursa (job #2260229) | Cod sursa (job #2854595) | Cod sursa (job #3204770)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <map>
#include <iomanip>
#include <climits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001];
int sp[6000001];
int main()
{
int n;
in >> n;
for(int i =1; i<= n ; i++)
{
in >> v[i];
sp[i]=sp[i-1]+v[i];
}
int mini=0,index_aux=0,index2=1,index1;
int maxi=INT_MIN;
for(int i =1; i<= n ; i++)
{
if(sp[i]-mini>maxi)
maxi=sp[i]-mini,index2=i,index1=index_aux;
if(sp[i]<mini)
mini=sp[i],index_aux=i;
}
out << maxi << ' ' << index1+1<< ' '<< index2;
return 0;
}