Cod sursa(job #1004136)
| Utilizator | Data | 2 octombrie 2013 10:26:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int a,b;
inline int Max(int a, int b){
return (a > b ? a : b);
}
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,nr,i;
int best = -int(2e9), act = 0, jos, sus, josact=1;
in >> n;
for(i=1;i<=n;i++) {
in >> nr;
if (act < 0)
act = nr, josact = i;
else
act += nr;
if (best<act){
best=act;
jos = josact;
sus = i;
}
}
out <<best<<" "<<jos<<" "<<sus;
return 0;
}
