Cod sursa(job #2923679)
| Utilizator | Data | 17 septembrie 2022 19:58:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000005];
int main()
{
int n,i,x,mini,smax=0,poz1=1,poz2=0;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
s[i]=s[i-1]+x;
}
mini=s[0];
for(i=2;i<=n;i++)
{
if(s[i]-mini>smax)
{
smax=s[i]-mini;
poz2=i;
}
if(s[i]<mini)
{
mini=s[i];
poz1=i+1;
}
}
fout<<smax<<" "<<poz1<<" "<<poz2;
return 0;
}
