Pagini recente » Cod sursa (job #2266719) | Cod sursa (job #1682478) | Cod sursa (job #3158412) | Cod sursa (job #581789) | Cod sursa (job #368347)
Cod sursa(job #368347)
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n, k, v[6001000], w;
void read()
{ f >> n;
for (int i=1; i<=n; i++)
f >> v[i];
}
int maxim(int x, int y)
{ if (x>y) return x;
return y;
}
void suma()
{ int l1, l2;
int sum=v[1];
l1=1;
l2=2;
int cl1;
int cw=v[1];
for (int i=2; i<=n; i++)
{ w=maxim(w+v[i], v[i]);
if (w>sum) { sum=w; l2=i; cl1=l1+1;}
if (v[i]==w && cw!=0) l1=i;
cw=w;
}
g << sum << " " << cl1 << " " << l2;
}
int main()
{ read();
suma();
f.close();
g.close();
return 0;
}