Cod sursa(job #1143767)
| Utilizator | Data | 15 martie 2014 22:57:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
long int n,v[100002],i,j,smax=0,i1,i2,d,s,gasit;
int main()
{
ifstream f("secvsummax.in");
ofstream g("secvsummax.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
{ s=0;gasit=0;
for(d=i;d<=j;d++)
{s=s+v[d];if(v[d]>0) gasit=1;}
if(gasit==1)
if(s>smax) smax=s,i1=i,i2=j;
else if(s==smax && j-i+1<i2-i1+1) i1=i,i2=j;
}
}
g<<i1<<" "<<i2;
f.close();g.close();
return 0;
}
