Cod sursa(job #702031)
| Utilizator | Data | 1 martie 2012 19:06:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
program xxx;
var f,g:text;
smax,i,j,n,s,k,pozi,pozj,u:longint;
v:array [1..100] of longint;
su: array [0..100] of longint;
begin
assign (f,'ssm.in');
reset (f);
assign (g,'ssm.out');
rewrite (g);
read (f,n); j:=2;
For i:=1 to n do
begin
read (f,v[i]);
su[i]:=su[i-1]+v[i];
end;
for i:=1 to n-1 do
begin
For j:=i+1 to n do
Begin
S:=su[j]-su[i-1];
If s>smax then
Begin
Smax:=s;
Pozi:=I;
Pozj:=j;
End;
End;
end;
write (g,smax,' ',pozi,' ',pozj);
close (f);
close (g);
end.
