Cod sursa(job #2357741)
| Utilizator | Data | 27 februarie 2019 18:12:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,smax=0x80000000,p,u,x,pcrt;
f >> n;
int scrt=0;
for(int i = 1; i <= n; i++)
{
f>>x;
if(scrt>=0)
scrt+=x;
else
{
scrt=x;
pcrt=i;
}
if(smax<scrt)
{
smax=scrt;
p=pcrt;
u=i;
}
}
g << smax <<' '<<p<<' '<<u;
return 0;
}
/// 8 8 9 23 -4 -100 6 -2 43
/// 8 17 40 36 -64 -58 -60 -17
