Cod sursa(job #2910101)
| Utilizator | Data | 18 iunie 2022 15:06:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, s, pi, pf, maxi=-2000000000, ppi;
void ssm(int n)
{
int i, x;
pi = 1;
for (i = 1; i <= n; i++)
{
cin>>x;
if (s < 0)
{
s = x;
pi = i;
}
else s=s+x;
if (s > maxi)
{
ppi = pi;
pf = i;
maxi = s;
}
}
cout<<maxi<<" "<< ppi<<" "<< pf;
}
int main()
{
cin>>n;
ssm(n);
return 0;
}