Cod sursa(job #549954)
Utilizator | Data | 9 martie 2011 08:35:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
using namespace std;
ifstream k("fis.in");
ofstream z("fis.out");
int v[101],n,i,s,sm,p,u,j;
int main(){
k>>n;
for(i=1;i<=n;++i)
k>>v[i];
sm=v[1];
p=u=1;
for(i=1;i<=n;++i)
s=v[i];
j=i+1;
while(j<=n&&s+v[j]>=0){
s=s+v[j];
++j;
}
if(s>sm){
sm=s;
p=i;
u=j-1;
}
z<<sm<<" "<<p<<" "<<u<<'\n';
z.close();
return 0;
}