Cod sursa(job #2124332)
Utilizator | Data | 7 februarie 2018 09:23:51 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,i,x,s[50001],j,poz1,poz2,k,maxim;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
}
for(i=1;i<=n;i++)
{
for(j=k;j<=n;j++)
{
if(s[j]-s[i-1]>maxim){maxim=s[j]-s[i-1];poz1=j;poz2=i;}
}
}
g<<poz2-1<<" "<<poz1-1<<" "<<maxim;
return 0;
}