Cod sursa(job #1875956)
Utilizator | Data | 11 februarie 2017 20:11:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
long long i,n,a,b,maxi,l,u,p,nr,v[100001],s,j;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
for(i=1;i<=n;++i)
{
s=0;
for(j=i;j<=n;++j)
{
s+=v[j];
if(s>maxi){maxi=s; p=i; u=j;}
else if(s<0){s=v[j];i=j; break;}
}
}
fout<<p<<' '<<u;
return 0;
}