Pagini recente » Cod sursa (job #932490) | Cod sursa (job #2757666) | Cod sursa (job #3124055) | Cod sursa (job #2999682) | Cod sursa (job #1008722)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,i,v[6000000];
int inceput=1,final,max1,maxf;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++){
if(max1+v[i]>v[i]){
max1=max1+v[i];
final=i;
if(i==n&&v[n]<0){final=final-1;max1=max1+(-v[n]);}
}
else {
max1=v[i];
inceput=i;
}
}
g<<max1<<" "<<inceput<<" "<<final;
return 0;
}