Cod sursa(job #478409)
Utilizator | Data | 18 august 2010 15:32:12 | |
---|---|---|---|
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,s[6000001],k,st,dr,min1;
int main()
{
ifstream f("ssm.in",ios::in);
ofstream g("ssm.out",ios::out);
f>>n;
int max1=-2147483647;
for(int i=1;i<=n;i++)
{
f>>s[i];
}
for(int i=1;i<=n;i++)
{
s[i]+=s[i-1];
if(s[i]-min1>max1)
{max1=s[i]-min1;
st=k+1; dr=i;
}
if(s[i]<min1)
{
min1=s[i];
k=i;
}
}
g<<max1<<" "<<st<<" "<<dr;
}