Cod sursa(job #1886900)
| Utilizator | Data | 21 februarie 2017 11:14:14 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,best[6000001],bestsum,v[6000001],cont,i,nr[6000001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
bestsum=v[1];
for(i=1;i<=n;i++)
{
best[i]=v[i];
if(best[i]<best[i-1]+v[i]) {best[i]=best[i-1]+v[i];nr[i]++;}
if(bestsum<best[i]) {bestsum=best[i];
cont=i;
}
}
g<<bestsum<<" "<<cont-nr[cont]-2<<" "<<cont;
return 0;
}
