Cod sursa(job #633191)
Utilizator | Data | 13 noiembrie 2011 02:40:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int n, sum, s, best, poz1, x, y;
int main()
{ ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
best = -100000;
for( int i =1; i <= n; i++)
{ f>>s;
if(sum<0)
{ sum = s;
poz1 = i;
}
else sum += s;
if(best < sum)
{ best = sum;
x = poz1;
y = i;
}
}
g<<best<<" "<<x<<" "<<y;
return 0;
}