Cod sursa(job #583888)
Utilizator | szabo david emanuel david95 | Data | 23 aprilie 2011 11:04:39 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int a[10000],n,i,j,s,max=INT_MIN,st,dr;
fin>>n;
for(i=1;i<=n;i++) fin>>a[i];
s=0;
st=0;
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s<0)
{
s=0;
st=i+1;
}
else
if(s>max)
{
max=s;
dr=i;
}
}
fout<<max<<" "<<st<<" "<<dr<<endl;
for(i=st;i<=dr;i++) fout<<a[i]<<" ";
fin.close();
fout.close();
return 0;
}