Cod sursa(job #998474)
Utilizator | Data | 17 septembrie 2013 09:26:51 | |
---|---|---|---|
Problema | Bilute | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("bilute.in"); ofstream g("bilute.out");
long long s[30001],t[30001];
int n,i,p=1,C[30001],L[30001];
int main()
{ f>>n>>C[1]>>L[1]; s[1]=C[1];
for(i=2;i<=n;++i)
{ f>>C[i]>>L[i]; s[i]=s[i-1]+C[i]; t[1]+=(L[i]+i-1)*C[i];}
for(i=2;i<=n;++i)
{ t[i]=t[i-1]+C[i-1]*L[i-1]-C[i]*L[i]+2*s[i-1]-s[n];
if(t[i]<t[p]) p=i;
}
g<<p<<' '<<t[p]<<'\n'; g.close(); return 0;
}