Submission #5421

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
5421	2014-05-01 12:33:58	gs12006	Divide and conquer (IZhO14_divide)	C++98	100 / 100	160 ms	8824 KiB

divide

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <stdio.h>
#include <algorithm>
using namespace std;
long long int g[110000],l[110000],e[110000];
struct gw
{
  long long int x,e,w;
}a[220000];
bool cmp(gw x,gw y)
{
  if (x.e-l[x.x]==y.e-l[y.x]) return x.x<y.x;
  return x.e-l[x.x]<y.e-l[y.x]; 
}
int main()
{
  long long int n,i,se=0,ge=0,mini=1<<30,gmax=0;
  gw tgw;
  scanf("%lld",&n);
  for (i=0;i<n;i++)
  {
    scanf("%lld %lld %lld",&l[i+1],&g[i+1],&e[i+1]);
    g[i+1]+=ge;
    ge=g[i+1];
    e[i+1]+=se;
    se=e[i+1];
    tgw.e=e[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52