Cod sursa(job #1802655)
Utilizator | Andrei Cotor Andrei_Cotor | Data | 10 noiembrie 2016 15:55:40 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int n,s,sum,bst,ind,b,sf,i;
int main()
{
bst=-1000000000;
fi>>n;
for(i=1; i<=n; i++)
{
fi>>s;
if(sum<0)
{
sum=s,
ind=i;
}
else
sum+=s;
if (bst<sum)
{
bst=sum;
b=ind;
sf=i;
}
}
fo<<bst<<" "<<b<<" "<<sf;
fi.close();
fo.close();
return 0;
}