Cod sursa(job #1400643)
| Utilizator | Data | 25 martie 2015 13:07:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int x, st, s, fin, maxi, n, i, sum;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{ f>>n;
f>>x;
maxi=x;
sum=x;
st=s=fin=1;
for (i=2; i<=n; ++i)
{ f>>x;
sum+=x;
if (x>sum)
{ sum=x;
s=i;
}
if (x>maxi)
{ maxi=x;
st=fin=i;
}
if (sum>maxi)
{ maxi=sum;
fin=i;
st=s;
}
}
g<<maxi<<' '<<st<<' '<<fin<<'\n';
return 0;
}
