Cod sursa(job #1411805)
Utilizator | Data | 31 martie 2015 22:40:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
#include<iostream>
#include<climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i,x,s=0,p1,p2,p,smax=INT_MIN;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
if(s<0)
s=x,p=i;
else
s+=x;
if(smax<s)
smax=s,p1=p,p2=i;
else if(smax==s) if(p2-p1<p-i) p1=p,p2=i;
}
fout<<p1<<" "<<p2;
return 0;
}