Pagini recente » Borderou de evaluare (job #2113991) | Clasamentul arhivei de probleme | Cod sursa (job #1348062) | Clasamentul arhivei de probleme | Cod sursa (job #1149213)
#include<fstream>
#include<limits.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,v[6000001],s[6000001];
int main() {
int i,j,k,sc,smax=INT_MIN,start,end,x,smin=0,pmin=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>x;
s[i]=s[i-1]+x;
}
for(i=1;i<=n;i++)
{
sc=s[i]-smin;
if(sc>smax)
{
smax=sc;
start=pmin+1;
end=i;
}
if(s[i]<smin)
{
smin=s[i];
pmin=i;
}
}
out<<smax<<" "<<start<<" "<<end;
return 0;
}