Cod sursa(job #1180444)
| Utilizator | Data | 30 aprilie 2014 17:49:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int best,smax,dmax;
int main()
{
int i;
int a,r,s,d;
fin>>n;
fin>>a;
best=r=a;
s=d=1;
smax=dmax=1;
for(i=2; i<=n; i++)
{
fin>>a;
if(r + a >= a)
{
r += a;
d++;
}
else
{
r = a;
s = d = i;
}
if(r > best)
{
best = r;
smax = s;
dmax = d;
}
}
fout<<best<<' '<<smax<<' '<<dmax;
fin.close(); fout.close();
return 0;
}
