Cod sursa(job #1151077)
| Utilizator | Data | 23 martie 2014 20:39:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,nr,sum = 0, summaxim = -2000000000, doo, sol1 = 1, sol2;
f >> n;
for(int i=1; i<=n; i++)
{
f >> nr;
if(sum < 0)
{
sum = nr;
doo = i;
}
else
{
sum+=nr;
}
if(sum > summaxim && sum)
{
summaxim = sum;
sol1 = doo;
sol2 = i;
}
}
g << summaxim << " " << sol1 << " " << sol2 << '\n';
g.close();
return 0;
}
