Cod sursa(job #953389)
Utilizator | Data | 25 mai 2013 21:57:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,mx,st=1,mxi=1,mxj=1,a,b,bp;
f>>n>>bp;
mx=bp;
for(int i=2;i<=n;i++){
f>>a;
b=a;
if(bp+a>=b)
b=bp+a;
else
st=i;
if(b>mx){
mx=b;
mxi=st;
mxj=i;
}
bp=b;
}
g<<mx<<" "<<mxi<<" "<<mxj;
return 0;
}