Cod sursa(job #1639449)
Utilizator | Data | 8 martie 2016 12:29:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int n,x,i,st,dr,P,U,s,S;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
f>>x;
st=1;dr=1;s=x;P=1;U=1;S=x;
for(i=2;i<=n;++i)
{
f>>x;
if(s + x >= x)
{
s=s+x;
++dr;
}
else
{
s=x;
st=dr=i;
}
if(s > S)
{
S=s;
P=st;
U=dr;
}
}
g<<S<<" "<<P<<" "<<U<<"\n";
return 0;
}