Cod sursa(job #1494506)
Utilizator | Data | 1 octombrie 2015 11:38:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,x,cop,i,Max=0,w=0,p=0,q=0,s=0;
f>>n;
f>>x;
for(i=2; i<=n; i++)
{
cop=x;
f>>x;
if(cop+x>=0)
{
p=i-1;
s=cop;
while(cop+x>=0 && i<=n)
{
cop=x;
s+=cop;
f>>x;
i++;
}
if(cop<=0)
{
i--;
s=s-cop;
}
if(s>Max)
{
Max=s;
w=p;
q=i-1;
}
}
}
g<<Max<<" "<<w<<" "<<q;
return 0;
}