Cod sursa(job #1617138)
Utilizator | Sergiu Druga dsergiu05 | Data | 27 februarie 2016 12:42:39 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int nmax=6e6, inf=2e9;
int v[nmax+1];
int main () {
int n;
fin>>n;
for (int i=1; i<=n; i++) {
fin>>v[i];
v[i]+=v[i-1];
}
int sol=-inf,solx,soly;
for (int i=1; i<=n; i++) {
for (int j=i; j<=n; j++) {
if (v[j]-v[i-1]>sol) {
sol=v[j]-v[i-1];
solx=i;
soly=j;
}
}
}
fout<<sol<<" "<<solx<<" "<<soly<<"\n";
return 0;
}