Cod sursa(job #926520)
Utilizator | Data | 25 martie 2013 11:36:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n, smax=-1<<31, l2, l1, a=1, s=0;
f>>n;
for(int x, i=1; i<=n; ++i)
{
f>>x;
if(s<0){
s=x;
a=i;
}
else s+=x;
if(s>smax){
smax=s;
l1=a; l2=i;
}
}
g<<smax<<" "<<l1<<" "<<l2<<'\n';
g.close();
return 0;
}