Cod sursa(job #2407659)
| Utilizator | Data | 17 aprilie 2019 09:41:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,x,s[6000005],smax,maxx,minn,pozmax,pozmin;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
if(s[i]>maxx)
{
maxx=s[i];
pozmax=i;
}
}
for(j=1;j<=pozmax;j++)
if(s[j]<minn)
{
minn=s[j];
pozmin=j;
}
smax=maxx-minn;
fout<<smax<<" "<<pozmin+1<<" "<<pozmax;
fin.close();
fout.close();
return 0;
}
