Cod sursa(job #665378)
| Utilizator |  Poenar Liana bia.lili |
Data | 21 ianuarie 2012 23:34:05 |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int i, n, x, max =-10000, pozitia_i, pozitia_j, s=0, p=0;
f>>n>>x;
for (i=1; i<=n; i++)
{
if (s<0)
{
p=i;
s=x;
}
else
s+=x;
if (s>max)
max=s;
pozitia_i=p, pozitia_j=i;
}
g<<max<<" "<<pozitia_i<<" "<<pozitia_j;
return 0;}
