Cod sursa(job #825109)
| Utilizator | Data | 27 noiembrie 2012 14:58:23 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream os("secv2.out");
int a[1000];
int N;
int main()
{
in >> N;
int K;
in >> K;
for(int i = 1; i <= N; ++i)
{
in >> a[i];
}
int st, dr;
int smax = K;
int s = 0;
int p1 = 0, p2 = 0;
for(int i = 1; i < N; ++i)
{
s += a[i];
if ( s >= 0)
{
p2 = i;
if ( s > smax )
{
smax = s;
st = p1;
dr = p2;
}
}
else
{
s = 0;
p1 = i + 1;
}
}
os << st << ' ' << dr << ' ' << smax;
in.close();
os.close();
return 0;
}
