Cod sursa(job #1666834)
Utilizator | Data | 28 martie 2016 13:45:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x[6000001],s,maxx=INT_MIN;
int main()
{
int n,i,j,k,ii,jj,iii,jjj;
f>>n;
for(i=1;i<=n;i++)
{
f>>x[i];
if(x[i]>s+x[i])
{
s=x[i];
iii=i;
jjj=i;
}
else
{
s=s+x[i];
jjj++;
}
if(s>maxx)
{
maxx=s;
ii=iii;
jj=jjj;
}
}
g<<maxx<<" "<<ii<<" "<<jj;
return 0;
}