lightoj 1369 - Answering Queries (思维规律)
来源:互联网 发布:匈牙利算法 证明过程 编辑:程序博客网 时间:2024/06/05 09:38
The problem you need to solve here is pretty simple. You are give a function f(A, n), where A is an array of integers and n is the number of elements in the array. f(A, n) is defined as follows:
long long f( int A[], int n ) { // n = size of A
long long sum = 0;
for( int i = 0; i < n; i++ )
for( int j = i + 1; j < n; j++ )
sum += A[i] - A[j];
return sum;
}
Given the array A and an integer n, and some queries of the form:
1) 0 x v (0 ≤ x < n, 0 ≤ v ≤ 106), meaning that you have to change the value of A[x] to v.
2) 1, meaning that you have to find f as described above.
Input
Input starts with an integer T (≤ 5), denoting the number of test cases.
Each case starts with a line containing two integers: n and q (1 ≤ n, q ≤ 105). The next line contains n space separated integers between 0 and 106 denoting the array A as described above.
Each of the next q lines contains one query as described above.
Output
For each case, print the case number in a single line first. Then for each query-type "1" print one single line containing the value of f(A, n).
Sample Input
Output for Sample Input
1
3 5
1 2 3
1
0 0 3
1
0 2 1
1
Case 1:
-4
0
4
Note
Dataset is huge, use faster I/O methods.
#include<cstdio>int a[100000+10];long long f(int a[],int n){long long s=0,tem=0;for(int i=1;i<n;i++)tem+=a[0]-a[i];s=tem;for(int i=1;i<n;i++){long long t=a[i]-a[i-1];//必须先化成long long 型 tem+=(n-i)*t;s+=tem;}return s;}int main(){int t,n,q;int k=1;int flag,x,v;scanf("%d",&t);while(t--){scanf("%d%d",&n,&q); for(int i=0;i<n;i++){scanf("%d",&a[i]);}printf("Case %d:\n",k++);long long sum=f(a,n);while(q--){scanf("%d",&flag);if(flag==1){printf("%lld\n",sum);}else{scanf("%d%d",&x,&v);long long tem=(v-a[x]);sum+=(n-2*x-1)*tem;a[x]=v;}}}return 0;}
- lightoj 1369 - Answering Queries (思维规律)
- LightOJ 1369 - Answering Queries(规律)
- lightoj 1369 - Answering Queries 【思维】
- lightoj 1369 - Answering Queries
- lightoj 1369 Answering Queries
- lightoj 1369 - Answering Queries (数学、规律、水)
- 【技巧】LightOj Answering Queries 1369
- lightoj 1369 - Answering Queries 数学
- LightOJ 1369 - Answering Queries (预处理)
- Light OJ 1369 - Answering Queries 【规律】
- Light OJ 1369 Answering Queries (思维)
- lightoj Answering Queries 1369 (数学转换&&技巧)
- 1369 - Answering Queries
- 1369 - Answering Queries<数>
- light oj 1369 - Answering Queries
- lightoj 1100 - Again Array Queries 【思维题】
- R - Answering Queries
- 1369 - Answering Queries (线段树的单点更新)
- 从Redis+Lua到Goroutine,日均10亿次的股票行情计算
- WebView加载闪屏问题
- LeetCode 226 Invert Binary Tree
- HDU 2083 简易版之最短距离
- Mac上更新Ruby,安装cocoapods详细教程
- lightoj 1369 - Answering Queries (思维规律)
- 评价系统海量数据存储设计
- 单片机基础
- target操作,对当前单元格进行操作
- malloc和free的具体用法举例
- 细述 Java垃圾回收机制→How Java Garbage Collection Works?
- Git教程推荐
- μC/OS—III为缩短中断关闭时间作出的改进
- Packetdrill 简明使用手册