Cod sursa(job #2409542)
| Utilizator | Data | 19 aprilie 2019 10:45:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x, n, i, j, smin=1<<30, s, smax=1<<31;
int main()
{
fin>>n;
fin>>x;
s=x;
for (int a=2;a<=n;a++)
{
fin>>x;
s+=x;
if (s<smin)
{
smin=s;
i=a+1;
smax=1<<31;
}
if (s>smax && a>=i)
{
smax=s;
j=a;
}
}
fout<<smax-smin<<' '<<i<<' '<<j;
return 0;
}
