Cod sursa(job #1999816)
| Utilizator | Data | 12 iulie 2017 10:48:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int sir[6000001], n,s=0,mi=2000000000,ma=-2000000000,inc,sfr;
void citire()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>sir[i];
s+=sir[i];
sir[i]=s;
if(sir[i]<mi)
{
mi=sir[i];
inc=i+1;
}
}
}
void findsir()
{
for(int i=inc; i<=n; i++)
if(ma<sir[i]-mi)
{
ma=sir[i]-mi;
sfr=i;
}
}
int main()
{
citire();
findsir();
g<<ma<<' '<<inc<<' '<<sfr;
return 0;
}
