Cod sursa(job #1148539)
Utilizator | Data | 20 martie 2014 21:13:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#include<climits>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int x,n,s,b,begin,end,maxim;
f>>n; maxim=INT_MIN;
for(int i=1;i<=n;i++)
{
f>>x;
if(s<=0) {s=x; b=i;}
else s+=x;
if(s>maxim) {maxim=s;begin=b;end=i;}
}
g<<maxim<<' '<<begin<<' '<<end<<'\n';
g.close();
return 0;
}