Cod sursa(job #941539)
| Utilizator | Data | 18 aprilie 2013 23:49:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long bestsum,sum=0,begin,end,s,n,aux;
int main()
{
f>>n;
for (int i=1; i<=n; i++)
{
f>>s;
if (sum<0) sum=s, aux=i;
else sum+=s;
if (bestsum<sum)
{
bestsum=sum; begin=aux; end=i;
}
}
g<<bestsum<<" "<<begin<<" "<<end<<'\n';
f.close(); g.close();
return 0;
}
