Cod sursa(job #1129479)
Utilizator | Data | 27 februarie 2014 22:31:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int n,v[6000001],Min,Max,pmin,p,fin;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{f>>n>>v[1];
Max=v[1];
for(int i=2;i<=n;i++)
{f>>v[i];
v[i]+=v[i-1];
if(Min>v[i])
{Min=v[i];
pmin=i;
}
if(Max<v[i]-Min)
{Max=v[i]-Min;
p=pmin;
fin=i;
}
}
g<<Max<<' '<<p+1<<' '<<fin;
return 0;
}