Cod sursa(job #1520286)
Utilizator | Data | 8 noiembrie 2015 16:20:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
long long Min,x,n,i,sol,s[6000001],pozi,pof;
int main()
{
fin>>n;
Min=0;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=x+s[i-1];
if(Min>s[i-1])
{
Min=s[i-1];
pozi=i;
}
if(sol<s[i]-Min)
{
sol=s[i]-Min;
pof=i;
}
}
fout<<sol<<" "<<pozi<<" "<<pof;
return 0;
}