Cod sursa(job #585384)
Utilizator | Data | 29 aprilie 2011 09:15:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{int s,sum,st,dr,i,j,k,v[100000],n;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
for(j=n;j>=1;j--)
{s=0;
for(k=i;k<=j;k++)
{
s+=v[k];
if(s>sum)
{sum=s;
st=i;
dr=j;}
}
}
g<<sum<<" "<<st<<" "<<dr;
return 0;
}