Cod sursa(job #2117424)
Utilizator | Liscan Rares RaresLiscan | Data | 28 ianuarie 2018 20:59:47 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int v[6000005],x[6000005];
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n;
fin>>n;
int m=0x3f3f3f3f,mi=0,mj=1,ma=0;
for (int i=1;i<=n;i++) {
fin>>v[i];
x[i]=v[i]+x[i-1];
if (m>x[i]) {
m=x[i];
mi=i;
}
if (ma<x[i]) {
ma=x[i];
mj=i;
}
}
fout<<ma-m<<" "<<mi+1<<" "<<mj;
fin.close();
fout.close();
return 0;
}