Cod sursa(job #2172519)
Utilizator | Data | 15 martie 2018 16:52:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,v[6000010],i,smax,a,p,u,Min;
int main()
{
in>>n;
Min=INT_MAX;
for(i=1;i<=n;i++) in>>v[i];
for(i=1;i<=n;i++)
{
v[i]+=v[i-1];
if(smax<v[i]-Min)
{
smax=v[i]-Min;
p=a+1;
u=i;
}
if(v[i]<Min)
{
Min=v[i];
a=i;
}
}
out<<smax<<" "<<p<<" "<<u;
return 0;
}