Cod sursa(job #3265476)
| Utilizator | Data | 30 decembrie 2024 14:22:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
#define INF 2e9
int main()
{
int n, smax=-999999999, sc=0;
fin >> n;
int st=0, dr=0;
int ok=0;
for (int i=0; i<n; i++)
{
int x;
fin >> x;
sc+=x;
if (ok==0)
{
st=0;
ok=1;
}
if (sc>smax)
{
smax=sc;
}
if(sc<0)
{
sc=0;
dr=i;
ok=0;
}
}
fout << smax << " " << st << " " << dr;
return 0;
}
