Cod sursa(job #1589084)
| Utilizator | Data | 3 februarie 2016 19:28:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[100001];
int main()
{
int n;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
int p,u;
p=1;
u=1;
int sumamax=0;
int suma=0;
int strsir=1;
for(int i=1;i<=n;i++)
{
suma+=v[i];
if(suma>sumamax)
{
sumamax=suma;
p=strsir;
u=i;
}
else if(suma<0)
{
suma=0;
strsir=i+1;
}
}
fout<<p<<" "<<u;
return 0;
}
