Cod sursa(job #1098886)
Utilizator | Data | 5 februarie 2014 12:17:24 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int pin,pif,m,n,pi,pf,i,best,x;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(best+x>x)
{
best+=x;
pf=i;
}
else
{
best=x;
pi=i;
}
if(best>m)
{
m=best;
pin=pi;
pif=pf;
}
}
g<<m<<" "<<pin<<" "<<pif<<'\n';
return 0;
}