Cod sursa(job #996289)
Utilizator | Data | 11 septembrie 2013 15:59:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, bestsum=-int(2e9), a, sum, inc, sf, aux;
int main()
{
f>>n;
for (int i=1; i<=n; ++i)
{
f>>a;
if (sum<0) sum=a, aux=i;
else sum+=a;
if (bestsum<sum) bestsum=sum, sf=i, inc=aux;
}
g<<bestsum<<' '<<inc<<' '<<sf<<'\n';
return 0;
}