Cod sursa(job #2323964)
| Utilizator | Data | 20 ianuarie 2019 09:27:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,i,j,s[6000005],a,b,maxsum=-99999,minsum;
int main()
{
fin >> n;
for (i=1;i<=n;i++)
{
fin >>s[i];
s[i]+=s[i-1];
if (maxsum<s[i]-minsum)
{
maxsum=s[i]-minsum;a=j+1;b=i;
}
if (minsum>s[i])
{
minsum=s[i];j=i;
}
}
fout<< maxsum<<" "<<a<<" "<<b;
return 0;
}
