Cod sursa(job #1097969)
Utilizator | Data | 4 februarie 2014 11:57:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define INF (1<<30)
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,sum,bestSum,elem,i,pozs,pozf,idx;
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>elem;
if (sum<0)
{
sum=elem; idx=i;
}
else sum+=elem;
if (sum>bestSum)
{
pozs=idx; pozf=i; bestSum=sum;
}
}
g<<bestSum<<" "<<pozs<<" "<<pozf;
return 0;
}